Pages that link to "Item:Q657654"

The following pages link to Complexity bounds for second-order optimality in unconstrained optimization (Q657654):

Displaying 41 items.

• Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality (Q504812) (← links)
• Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (Q526842) (← links)
• Updating the regularization parameter in the adaptive cubic regularization algorithm (Q694543) (← links)
• Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems (Q1673895) (← links)
• Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005) (← links)
• A geometric analysis of phase retrieval (Q1785008) (← links)
• Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints (Q1995981) (← links)
• Adaptive regularization with cubics on manifolds (Q2039233) (← links)
• Newton-type methods for non-convex optimization under inexact Hessian information (Q2205970) (← links)
• Lower bounds for finding stationary points I (Q2205972) (← links)
• Lower bounds for finding stationary points II: first-order methods (Q2220663) (← links)
• A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds (Q2288191) (← links)
• A note on inexact gradient and Hessian conditions for cubic regularized Newton's method (Q2294286) (← links)
• A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization (Q2297654) (← links)
• Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649) (← links)
• Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (Q2515043) (← links)
• Riemannian stochastic variance-reduced cubic regularized Newton method for submanifold optimization (Q2679570) (← links)
• OFFO minimization algorithms for second-order optimality and their complexity (Q2696918) (← links)
• A second-order globally convergent direct-search method and its worst-case complexity (Q2810113) (← links)
• Cubic overestimation and secant updating for unconstrained optimization of<i>C</i>^{2, 1}functions (Q2926071) (← links)
• On Regularization and Active-set Methods with Complexity for Constrained Optimization (Q4641664) (← links)
• Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization (Q4641667) (← links)
• Stochastic analysis of an adaptive cubic regularization method under inexact gradient evaluations and dynamic Hessian accuracy (Q5034938) (← links)
• Convergence of Newton-MR under Inexact Hessian Information (Q5148404) (← links)
• On the Complexity of an Inexact Restoration Method for Constrained Optimization (Q5210514) (← links)
• A concise second-order complexity analysis for unconstrained optimization using high-order regularized models (Q5210739) (← links)
• Sharp Restricted Isometry Bounds for the Inexistence of Spurious Local Minima in Nonconvex Matrix Recovery (Q5214201) (← links)
• (Q5214226) (← links)
• Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step (Q5233102) (← links)
• On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods (Q5253577) (← links)
• A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function (Q5299905) (← links)
• Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization (Q5853562) (← links)
• Lower bounds for non-convex stochastic optimization (Q6038643) (← links)
• Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy (Q6038660) (← links)
• Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization (Q6057628) (← links)
• Computing second-order points under equality constraints: revisiting Fletcher's augmented Lagrangian (Q6582431) (← links)
• Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds (Q6593831) (← links)
• Set-limited functions and polynomial-time interior-point methods (Q6596326) (← links)
• Scalable adaptive cubic regularization methods (Q6608033) (← links)
• Trust region-type method under inexact gradient and inexact Hessian with convergence analysis (Q6665208) (← links)
• Hessian barrier algorithms for non-convex conic optimization (Q6665383) (← links)