A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1919456
- A sequential quadratic programming method for potentially infeasible mathematical programs
- New sequential quadratic programming algorithm with consistent subproblems
- A computationally efficient feasible sequential quadratic programming algorithm
- A perturbed strongly sub-feasible sequential quadratic programming algorithm
- An efficient sequential quadratic programming algorithm for nonlinear programming
- scientific article; zbMATH DE number 1101644
- A sequential quadratic programming algorithm with an additional equality constrained phase
- scientific article; zbMATH DE number 3965826
- An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
Cited in
(27)- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- An SQP algorithm with cautious updating criteria for nonlinear degenerate problems
- A sparse sequential quadratic programming algorithm
- An SQP method for general nonlinear programs using only equality constrained subproblems
- Global convergence on an active set SQP for inequality constrained optimization
- Sequential quadratic programming with step control using the Lagrange function
- On the augmented subproblems within sequential methods for nonlinear programming
- An inexact sequential quadratic optimization algorithm for nonlinear optimization
- Inexact sequential quadratic optimization with penalty parameter updates within the QP solver
- Goal and predictive coordination in two level hierarchical systems
- scientific article; zbMATH DE number 4055377 (Why is no real title available?)
- scientific article; zbMATH DE number 4066630 (Why is no real title available?)
- scientific article; zbMATH DE number 125260 (Why is no real title available?)
- scientific article; zbMATH DE number 724208 (Why is no real title available?)
- Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms
- An intelligent moving object optimization algorithm for design problems with mixed variables, mixed constraints and multiple objectives
- scientific article; zbMATH DE number 1919456 (Why is no real title available?)
- Non-iterative co-ordination in multilevel systems
- A projected gradient and constraint linearization method for nonlinear model predictive control
- Sequential quadratic programming methods for parametric nonlinear optimization
- Primal-dual active-set methods for large-scale optimization
- A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming
- An adaptive stochastic sequential quadratic programming with differentiable exact augmented Lagrangians
- Sequential quadratic programming with a flexible step acceptance strategy
- A local convergence analysis of bilevel decomposition algorithms
- A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function
This page was built for publication: A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4852583)
