scientific article; zbMATH DE number 3848110

MaRDI QIDQ3317657zbMATH OpenFDO

Authors Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright

Publication date 1981

zbMATH Keywords

nonlinearly constrained optimizationquadratic programming subproblem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Nonlinear programming (90C30)

Recommendations

• SQP methods for large-scale nonlinear programming
• An efficient method for non-convex QCQP problems
• Sequential quadratic programming for large-scale nonlinear optimization
• scientific article; zbMATH DE number 977904
• A QP-free method for nonlinear programming problems
• Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
• scientific article; zbMATH DE number 553950
• A globally convergent QP-free algorithm for optimization with nonlinear complementarity constraints
• Sequential quadratic programming methods for large-scale problems
• Global convergence of QPFTH method for large-scale nonlinear sparse constrained optimization

Cited in

(8)

• A sparse sequential quadratic programming algorithm
• Modifications to the subroutine OPALQP for dealing with large problems
• QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
• A reduced proximal-point homotopy method for large-scale non-convex BQP
• Large-scale MV efficient frontier computation via a procedure of parametric quadratic programming
• scientific article; zbMATH DE number 977904 (Why is no real title available?)
• scientific article; zbMATH DE number 1086747 (Why is no real title available?)
• Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3317657)