Cubic overestimation and secant updating for unconstrained optimization ofC2, 1functions
From MaRDI portal
Publication:2926071
DOI10.1080/10556788.2013.863308zbMath1306.90150OpenAlexW1984610741WikidataQ57389584 ScholiaQ57389584MaRDI QIDQ2926071
Andreas Griewank, Jonathan Fischer, Torsten Bosse
Publication date: 29 October 2014
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2013.863308
Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Decomposition methods (49M27) Methods of successive quadratic programming type (90C55)
Related Items (5)
Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization ⋮ The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction ⋮ Cubic regularization in symmetric rank-1 quasi-Newton methods ⋮ A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques ⋮ Nonsmooth optimization by successive abs-linearization in function spaces
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
- Complexity bounds for second-order optimality in unconstrained optimization
- Rank-one modification of the symmetric eigenproblem
- Cubic regularization of Newton method and its global performance
- On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization
- Newton’s Method with a Model Trust Region Modification
- CUTE
- Trust Region Methods
- Affine conjugate adaptive Newton methods for nonlinear elastomechanics
- Some Modified Matrix Eigenvalue Problems
This page was built for publication: Cubic overestimation and secant updating for unconstrained optimization ofC2, 1functions
