Pages that link to "Item:Q2001208"
From MaRDI portal
The following pages link to Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (Q2001208):
Displaying 6 items.
- A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis (Q1730832) (← links)
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints (Q1995981) (← links)
- Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
- Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints (Q5217594) (← links)
- A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees (Q6114780) (← 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)
