On the use of iterative methods in cubic regularization for unconstrained optimization
From MaRDI portal
Publication:2515064
Recommendations
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- An improvement of adaptive cubic regularization method for unconstrained optimization problems
- An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem
- A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques
Cites work
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Affine conjugate adaptive Newton methods for nonlinear elastomechanics
- An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
- Benchmarking optimization software with performance profiles.
- Convergence of a regularized Euclidean residual algorithm for nonlinear least-squares
- Cubic regularization of Newton method and its global performance
- CUTEr and SifDec
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Interior-point methods for nonconvex nonlinear programming: cubic regularization
- Modified Gauss–Newton scheme with worst case guarantees for global performance
- Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
- Pattern recognition and machine learning.
- Solving the Trust-Region Subproblem using the Lanczos Method
- Strong local convergence properties of adaptive regularized methods for nonlinear least squares
- Updating the regularization parameter in the adaptive cubic regularization algorithm
Cited in
(33)- Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems
- Cubic regularization in symmetric rank-1 quasi-Newton methods
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- An accelerated first-order method with complexity analysis for solving cubic regularization subproblems
- Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
- On monotonic estimates of the norm of the minimizers of regularized quadratic functions in Krylov spaces
- Newton-type methods for non-convex optimization under inexact Hessian information
- An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem
- On global minimizers of quadratic functions with cubic regularization
- Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation
- A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization
- A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques
- Accelerated methods for nonconvex optimization
- ARC\(_q\): a new adaptive regularization by cubics
- On regularization and active-set methods with complexity for constrained optimization
- An improvement of adaptive cubic regularization method for unconstrained optimization problems
- Stochastic analysis of an adaptive cubic regularization method under inexact gradient evaluations and dynamic Hessian accuracy
- First-Order Methods for Nonconvex Quadratic Minimization
- Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem
- Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
- Gradient descent finds the cubic-regularized nonconvex Newton step
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- A Unified Efficient Implementation of Trust-region Type Algorithms for Unconstrained Optimization
- Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search
- An adaptive regularization method in Banach spaces
- Newton-MR: inexact Newton method with minimum residual sub-problem solver
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Scalable adaptive cubic regularization methods
- Trust region-type method under inexact gradient and inexact Hessian with convergence analysis
- On convergence of the generalized Lanczos trust-region method for trust-region subproblems
- Subsampled cubic regularization method for finite-sum minimization
- Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization
This page was built for publication: On the use of iterative methods in cubic regularization for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515064)
