A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques
From MaRDI portal
Publication:2829572
Recommendations
- An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem
- On the use of iterative methods in cubic regularization for unconstrained optimization
- Non-monotone cubic regularization BB algorithm for unconstrained optimization
- Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search
- A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis
- A nonmonotone line search method and its convergence for unconstrained optimization
- A non-monotone line search algorithm for unconstrained optimization
- An improvement of adaptive cubic regularization method for unconstrained optimization problems
- Interior-point methods for nonconvex nonlinear programming: cubic regularization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
Cites work
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A Nonmonotone Line Search Technique for Newton’s Method
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization
- 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
- Benchmarking optimization software with performance profiles.
- CUTEr and SifDec
- Cubic overestimation and secant updating for unconstrained optimization of \(C^{2,1}\) functions
- Cubic regularization of Newton method and its global performance
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Interior-point methods for nonconvex nonlinear programming: cubic regularization
- Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Nonmonotonic trust region algorithm
- On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
- On the use of iterative methods in cubic regularization for unconstrained optimization
- Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization
- Solving the Trust-Region Subproblem using the Lanczos Method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Trust Region Methods
- Updating the regularization parameter in the adaptive cubic regularization algorithm
Cited in
(17)- Non-monotone cubic regularization BB algorithm for unconstrained optimization
- A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis
- A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
- On the use of iterative methods in cubic regularization for unconstrained optimization
- Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search
- scientific article; zbMATH DE number 3885229 (Why is no real title available?)
- 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 of Newton's method with finite difference Hessian approximations
- A fast and simple modification of Newton's method avoiding saddle points
- On global minimizers of quadratic functions with cubic regularization
- An adaptive regularization method in Banach spaces
- Updating the regularization parameter in the adaptive cubic regularization algorithm
- A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization
- Cubic regularization in symmetric rank-1 quasi-Newton methods
- On regularization and active-set methods with complexity for constrained optimization
This page was built for publication: A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829572)
