Pages that link to "Item:Q5853562"

The following pages link to Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization (Q5853562):

Displayed 10 items.

• Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation (Q2676160) ‎ (← links)
• MINRES: From Negative Curvature Detection to Monotonicity Properties (Q5051375) ‎ (← links)
• Escaping Strict Saddle Points of the Moreau Envelope in Nonsmooth Optimization (Q5097019) ‎ (← links)
• Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization (Q6046826) ‎ (← links)
• Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems (Q6051305) ‎ (← links)
• A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems (Q6099495) ‎ (← links)
• A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees (Q6114780) ‎ (← links)
• Newton-MR: inexact Newton method with minimum residual sub-problem solver (Q6114941) ‎ (← links)
• A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression (Q6114952) ‎ (← 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)