Pages that link to "Item:Q4641667"

The following pages link to Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization (Q4641667):

Displaying 23 items.

• Regional complexity analysis of algorithms for nonconvex smooth optimization (Q2020615) (← links)
• A generalized worst-case complexity analysis for non-monotone line searches (Q2028039) (← links)
• An accelerated first-order method with complexity analysis for solving cubic regularization subproblems (Q2044484) (← links)
• A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization (Q2297654) (← links)
• A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization (Q2419564) (← links)
• Exploiting negative curvature in deterministic and stochastic optimization (Q2425164) (← links)
• First-order methods almost always avoid strict saddle points (Q2425175) (← links)
• Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation (Q2676160) (← links)
• Extending the Step-Size Restriction for Gradient Descent to Avoid Strict Saddle Points (Q5027014) (← links)
• Escaping Strict Saddle Points of the Moreau Envelope in Nonsmooth Optimization (Q5097019) (← links)
• First-Order Methods for Nonconvex Quadratic Minimization (Q5113167) (← links)
• Convergence of Newton-MR under Inexact Hessian Information (Q5148404) (← links)
• Error estimates for iterative algorithms for minimizing regularized quadratic subproblems (Q5210741) (← links)
• (Q5214226) (← links)
• Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization (Q5853562) (← links)
• Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization (Q6046826) (← links)
• Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization (Q6057628) (← links)
• A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees (Q6114780) (← links)
• A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression (Q6114952) (← links)
• Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound (Q6116246) (← links)
• A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees (Q6116250) (← links)
• The evaluation complexity of finding high-order minimizers of nonconvex optimization (Q6200212) (← links)
• Recent Theoretical Advances in Non-Convex Optimization (Q6355806) (← links)