Pages that link to "Item:Q2330649"
From MaRDI portal
The following pages link to Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649):
Displaying 10 items.
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints (Q1995981) (← links)
- On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming (Q2044492) (← links)
- Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization (Q2125072) (← links)
- Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints (Q2148118) (← links)
- On constrained optimization with nonconvex regularization (Q2225521) (← links)
- Sparse Solutions by a Quadratically Constrained ℓq (0 <<i>q</i>< 1) Minimization Model (Q4995085) (← links)
- High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks (Q5060495) (← links)
- On Optimality Conditions for Nonlinear Conic Programming (Q5868952) (← 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)
