A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds
From MaRDI portal
Publication:2288191
Recommendations
- A trust region method for finding second-order stationarity in linearly constrained nonconvex optimization
- Finding second-order stationary points in constrained minimization: a feasible direction approach
- Accelerated methods for nonconvex optimization
- A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees
- Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality
Cites work
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- A second-order globally convergent direct-search method and its worst-case complexity
- A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
- Accelerated methods for nonconvex optimization
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- Combining and scaling descent and negative curvature directions
- Complexity bounds for second-order optimality in unconstrained optimization
- Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Exploiting negative curvature directions in linesearch methods for unconstrained optimization
- Finding approximate local minima faster than gradient descent
- Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
- Introduction to Derivative-Free Optimization
- Newton’s Method with a Model Trust Region Modification
- Nonconvex optimization using negative curvature within a modified linesearch
- Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality
- On the use of directions of negative curvature in a modified newton method
- Recent advances in trust region algorithms
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
- The use of quadratic regularization with a cubic descent condition for unconstrained optimization
- Trust Region Methods
- Trust-region methods without using derivatives: worst case complexity and the nonsmooth case
Cited in
(8)- Regional complexity analysis of algorithms for nonconvex smooth optimization
- An active set trust-region method for bound-constrained optimization
- Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization
- A concise second-order complexity analysis for unconstrained optimization using high-order regularized models
- Derivative-free optimization methods
- Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization
- An adaptive regularization method in Banach spaces
- Riemannian trust-region methods for strict saddle functions with complexity guarantees
This page was built for publication: A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2288191)
