Pages that link to "Item:Q2297654"
From MaRDI portal
The following pages link to A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization (Q2297654):
Displaying 14 items.
- Inexact derivative-free optimization for bilevel learning (Q2036198) (← links)
- Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives (Q2052165) (← links)
- 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)
- First-Order Methods for Nonconvex Quadratic Minimization (Q5113167) (← links)
- Convergence of Newton-MR under Inexact Hessian Information (Q5148404) (← 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)
- Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems (Q6051305) (← links)
- A truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem (Q6086842) (← 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)
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees (Q6116250) (← links)
