Pages that link to "Item:Q4862783"
From MaRDI portal
The following pages link to Sequential Quadratic Programming with Penalization of the Displacement (Q4862783):
Displaying 13 items.
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
- Sequential penalty quadratic programming filter methods for nonlinear programming (Q864206) (← links)
- A feasible and superlinear algorithm for inequality constrained minimization problems (Q1568229) (← links)
- A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations (Q1576323) (← links)
- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity (Q1765848) (← links)
- Nonconvex optimization using negative curvature within a modified linesearch (Q2482748) (← links)
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity (Q2485397) (← links)
- A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization (Q4653552) (← links)
- A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices (Q5058396) (← links)
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming (Q5942348) (← 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)
- A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization (Q6642793) (← links)
