Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality
From MaRDI portal
Publication:504812
DOI10.1007/s10957-016-1007-xzbMath1354.90138OpenAlexW2509591300MaRDI QIDQ504812
Jin Yun Yuan, Ya-Xiang Yuan, Geovani Nunes Grapiglia
Publication date: 17 January 2017
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-1007-x
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37)
Related Items
An adaptive trust-region method without function evaluations ⋮ Concise complexity analyses for trust region methods ⋮ A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization ⋮ An active set trust-region method for bound-constrained optimization ⋮ On the worst-case evaluation complexity of non-monotone line search algorithms ⋮ A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations ⋮ Improved optimization methods for image registration problems ⋮ Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization ⋮ Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization ⋮ Regional complexity analysis of algorithms for nonconvex smooth optimization ⋮ Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization ⋮ A generalized worst-case complexity analysis for non-monotone line searches ⋮ A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds ⋮ A concise second-order complexity analysis for unconstrained optimization using high-order regularized models ⋮ Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
Cites Work
- Unnamed Item
- On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
- A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- On a global complexity bound of the Levenberg-marquardt method
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Complexity bounds for second-order optimality in unconstrained optimization
- Convergence rate of the trust region method for nonlinear equations under local error bound condition
- A new trust region method for nonlinear equations
- Introductory lectures on convex optimization. A basic course.
- Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
- A quasi-Newton trust region method with a new conic model for the unconstrained optimization
- Cubic regularization of Newton method and its global performance
- On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization
- Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- On the global convergence of trust region algorithms for unconstrained minimization
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- Trust Region Methods
- Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
- Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization
- Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
- Modified Gauss–Newton scheme with worst case guarantees for global performance
This page was built for publication: Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality
