Pages that link to "Item:Q2452373"

The following pages link to On the complexity of finding first-order critical points in constrained nonlinear optimization (Q2452373):

Displaying 16 items.

• Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization'' (Q507344) (← links)
• Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005) (← links)
• Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints (Q1995981) (← links)
• Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (Q2001208) (← links)
• A derivative-free trust-region algorithm for composite nonsmooth optimization (Q2013620) (← links)
• Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization (Q2125072) (← links)
• The multiproximal linearization method for convex composite problems (Q2191762) (← links)
• Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649) (← links)
• Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520) (← links)
• Riemannian stochastic variance-reduced cubic regularized Newton method for submanifold optimization (Q2679570) (← links)
• Stochastic first-order methods for convex and nonconvex functional constrained optimization (Q2689819) (← links)
• Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models (Q2802144) (← links)
• Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs (Q2806813) (← links)
• Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization (Q5219665) (← 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)
• Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization (Q6126655) (← links)