Pages that link to "Item:Q6113530"
From MaRDI portal
The following pages link to Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization (Q6113530):
Displaying 5 items.
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints (Q1995981) (← links)
- Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization (Q2125072) (← links)
- Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization (Q2866204) (← links)
- Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
- Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs (Q5237309) (← links)