Pages that link to "Item:Q535013"
From MaRDI portal
The following pages link to Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results (Q535013):
Displaying 50 items.
- On global minimizers of quadratic functions with cubic regularization (Q2329649) (← links)
- Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming (Q2330643) (← links)
- Algebraic rules for quadratic regularization of Newton's method (Q2340522) (← links)
- Recent advances in trust region algorithms (Q2349124) (← links)
- Certification of real inequalities: templates and sums of squares (Q2349133) (← links)
- An interior affine scaling cubic regularization algorithm for derivative-free optimization subject to bound constraints (Q2357423) (← links)
- A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions (Q2393063) (← links)
- Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems (Q2419539) (← links)
- A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization (Q2419564) (← links)
- On proximal gradient method for the convex problems regularized with the group reproducing kernel norm (Q2442634) (← links)
- On the complexity of finding first-order critical points in constrained nonlinear optimization (Q2452373) (← links)
- Cubic regularization of Newton method and its global performance (Q2494519) (← links)
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (Q2515043) (← links)
- On the use of iterative methods in cubic regularization for unconstrained optimization (Q2515064) (← links)
- Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation (Q2676160) (← links)
- Riemannian stochastic variance-reduced cubic regularized Newton method for submanifold optimization (Q2679570) (← links)
- Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points (Q2696568) (← links)
- Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares (Q2696927) (← links)
- A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization (Q2696932) (← links)
- On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization (Q2815548) (← links)
- A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques (Q2829572) (← links)
- An inexact ℓ<sub>1</sub>penalty SQP algorithm for PDE-constrained optimization with an application to shape optimization in linear elasticity (Q2867419) (← links)
- Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization (Q2885470) (← links)
- Cubic overestimation and secant updating for unconstrained optimization of<i>C</i><sup>2, 1</sup>functions (Q2926071) (← links)
- Adaptive Quadratically Regularized Newton Method for Riemannian Optimization (Q3176355) (← links)
- Accelerated Methods for NonConvex Optimization (Q4571877) (← links)
- On High-order Model Regularization for Constrained Optimization (Q4602340) (← links)
- Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization (Q4620420) (← links)
- A Newton-Based Method for Nonconvex Optimization with Fast Evasion of Saddle Points (Q4620423) (← links)
- On the Quadratic Convergence of the Cubic Regularization Method under a Local Error Bound Condition (Q4634142) (← links)
- A Flexible Framework for Cubic Regularization Algorithms for Nonconvex Optimization in Function Space (Q4634177) (← links)
- <tt>trlib</tt>: a vector-free implementation of the GLTR method for iterative solution of the trust region problem (Q4637824) (← links)
- The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction (Q4638912) (← links)
- ARC<sub>q</sub>: a new adaptive regularization by cubics (Q4638924) (← links)
- On Regularization and Active-set Methods with Complexity for Constrained Optimization (Q4641664) (← links)
- Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization (Q4641667) (← links)
- Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization (Q4641670) (← links)
- Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization (Q4924105) (← links)
- Adaptive cubic regularization methods with dynamic inexact Hessian information and applications to finite-sum minimization (Q4964100) (← links)
- An improvement of adaptive cubic regularization method for unconstrained optimization problems (Q5031220) (← links)
- Stochastic analysis of an adaptive cubic regularization method under inexact gradient evaluations and dynamic Hessian accuracy (Q5034938) (← links)
- On high-order model regularization for multiobjective optimization (Q5038176) (← links)
- On a multilevel Levenberg–Marquardt method for the training of artificial neural networks and its application to the solution of partial differential equations (Q5038185) (← links)
- On the complexity of solving feasibility problems with regularized models (Q5038424) (← links)
- Sketched Newton--Raphson (Q5093644) (← links)
- First-Order Methods for Nonconvex Quadratic Minimization (Q5113167) (← links)
- A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization (Q5124006) (← links)
- A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization (Q5131958) (← links)
- Second-Order Guarantees of Distributed Gradient Algorithms (Q5131964) (← links)
- On High-Order Multilevel Optimization Strategies (Q5147030) (← links)
