Sequential Quadratic Programming Methods Based on Approximating a Projected Hessian Matrix
From MaRDI portal
Recommendations
- Quasi-Newton methods for solving nonlinear programming problems
- scientific article; zbMATH DE number 3878695
- A Reduced Hessian Method for Large-Scale Constrained Optimization
- Sequential quadratic programming for large-scale nonlinear optimization
- Numerical experience with a reduced Hessian method for large scale constrained optimization
Cited in
(8)- Numerical experience with a reduced Hessian method for large scale constrained optimization
- An SQP method for general nonlinear programs using only equality constrained subproblems
- Partially reduced sqp methods for large-scale nonlinear optimization problems
- Partitioned quasi-Newton methods for nonlinear equality constrained optimization
- Accelerating condensed interior-point methods on SIMD/GPU architectures
- An intelligent moving object optimization algorithm for design problems with mixed variables, mixed constraints and multiple objectives
- A reduced Hessian method for constrained optimization
- Nonlinear programming and nonsmooth optimization by successive linear programming
This page was built for publication: Sequential Quadratic Programming Methods Based on Approximating a Projected Hessian Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4205015)