On the use of iterative methods in cubic regularization for unconstrained optimization
From MaRDI portal
Publication:2515064
DOI10.1007/s10589-014-9672-xzbMath1308.90166OpenAlexW1971664328MaRDI QIDQ2515064
Tommaso Bianconcini, Benedetta Morini, Giampaolo Liuzzi, Marco Sciandrone
Publication date: 10 February 2015
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-014-9672-x
Related Items (23)
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 ⋮ Accelerated Methods for NonConvex Optimization ⋮ Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization ⋮ Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search ⋮ An adaptive regularization method in Banach spaces ⋮ On monotonic estimates of the norm of the minimizers of regularized quadratic functions in Krylov spaces ⋮ Newton-MR: inexact Newton method with minimum residual sub-problem solver ⋮ On the use of the energy norm in trust-region and adaptive cubic regularization subproblems ⋮ First-Order Methods for Nonconvex Quadratic Minimization ⋮ Newton-type methods for non-convex optimization under inexact Hessian information ⋮ Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem ⋮ Cubic regularization in symmetric rank-1 quasi-Newton methods ⋮ On Regularization and Active-set Methods with Complexity for Constrained Optimization ⋮ An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem ⋮ New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization ⋮ Error estimates for iterative algorithms for minimizing regularized quadratic subproblems ⋮ An accelerated first-order method with complexity analysis for solving cubic regularization subproblems ⋮ Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization ⋮ A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques ⋮ Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step ⋮ On global minimizers of quadratic functions with cubic regularization ⋮ Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
Uses Software
Cites Work
- Unnamed Item
- Interior-point methods for nonconvex nonlinear programming: cubic regularization
- 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
- Updating the regularization parameter in the adaptive cubic regularization algorithm
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Cubic regularization of Newton method and its global performance
- Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares
- On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
- An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
- Solving the Trust-Region Subproblem using the Lanczos Method
- Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization
- Strong local convergence properties of adaptive regularized methods for nonlinear least squares
- Affine conjugate adaptive Newton methods for nonlinear elastomechanics
- Modified Gauss–Newton scheme with worst case guarantees for global performance
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- CUTEr and SifDec
- Benchmarking optimization software with performance profiles.
This page was built for publication: On the use of iterative methods in cubic regularization for unconstrained optimization
