A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques

DOI10.1080/10556788.2016.1155213zbMath1351.49040OpenAlexW2334809277MaRDI QIDQ2829572

Tommaso Bianconcini, Marco Sciandrone

Publication date: 8 November 2016

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2016.1155213

zbMATH Keywords

unconstrained optimizationglobal convergencecubic regularizationGoldstein's line searchnonmonotone globalization methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (12)

An improvement of adaptive cubic regularization method for unconstrained optimization problems ⋮ A cubic regularization of Newton's method with finite difference Hessian approximations ⋮ Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search ⋮ An adaptive regularization method in Banach spaces ⋮ A fast and simple modification of Newton's method avoiding saddle points ⋮ A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization ⋮ 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 ⋮ 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 ⋮ On global minimizers of quadratic functions with cubic regularization

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
• Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization
• A truncated Newton method with non-monotone line search for unconstrained optimization
• Nonmonotonic trust region algorithm
• Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
• Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization
• Cubic regularization of Newton method and its global performance
• On the use of iterative methods in cubic regularization for unconstrained optimization
• Cubic overestimation and secant updating for unconstrained optimization ofC^{2, 1}functions
• On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Trust Region Methods
• Solving the Trust-Region Subproblem using the Lanczos Method
• A Nonmonotone Line Search Technique for Newton’s Method
• Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization
• 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: A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques