scientific article; zbMATH DE number 3963585

MaRDI QIDQ3731381zbMATH OpenFDO

Authors José Herskovits, L. A. V. Carvalho

Publication date 1986

zbMATH Keywords

descent directionLagrangian functionMaratos effectnonlinearly constrained optimizationrate of convergencetwo-stage feasible directions algorithm

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• A sequential quadratically constrained quadratic programming method of feasible directions
• A computationally efficient feasible sequential quadratic programming algorithm
• A new successive quadratic programming algorithm
• A successive quadratic programming method that uses new corrections for search directions
• A sequential quadratic programming method for potentially infeasible mathematical programs
• An efficient sequential quadratic programming algorithm for nonlinear programming
• A successive quadratic programming algorithm with global and superlinear convergence properties
• A successive quadratic programming method for a class of constrained nonsmooth optimization problems
• A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
• scientific article; zbMATH DE number 4158404

Cited in

(5)

• A new SQP method of feasible directions for nonlinear programming.
• An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
• A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF THE BINARY QUADRATIC PROGRAMMING
• A two-stage feasible directions algorithm for nonlinear constrained optimization
• Parameter identification in financial market models with a feasible point SQP algorithm

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 Q3731381)