A feasible SQP method for nonlinear programming
From MaRDI portal
Publication:2266975
DOI10.1016/J.AMC.2009.11.045zbMATH Open1185.65103OpenAlexW2031856370MaRDI QIDQ2266975FDOQ2266975
Authors: Zhenjie Geng, Zhibin Zhu, Weidong Zhang 
Publication date: 26 February 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2009.11.045
Recommendations
Cites Work
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- A computationally efficient feasible sequential quadratic programming algorithm
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- Title not available (Why is that?)
- An SQP method for general nonlinear programs using only equality constrained subproblems
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
- An improved SQP algorithm for inequality constrained optimization
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- A sequential quadratic programming method for potentially infeasible mathematical programs
- A successive quadratic programming algorithm with global and superlinear convergence properties
- Augmented Lagrangians which are quadratic in the multiplier
Cited In (18)
- Feedback stabilization methods for the solution of nonlinear programming problems
- Infeasibility Detection and SQP Methods for Nonlinear Optimization
- An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
- A practical update criterion for SQP method
- A feasible equality constrained SQP algorithm for nonlinear optimization
- A new SQP method of feasible directions for nonlinear programming.
- An efficient sequential quadratic programming algorithm for nonlinear programming
- Stochastic approach for the solution of multi-pantograph differential equation arising in cell-growth model
- Title not available (Why is that?)
- Title not available (Why is that?)
- A feasible filter SQP algorithm with global and local convergence
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- A computationally efficient feasible sequential quadratic programming algorithm
- Inequality-Equality Constrained Optimization: An Analytical Robustness Comparison of a Feasibility Method Versus L1 Sequential Quadratic Programming
- Line search SQP method with a flexible step acceptance procedure
- A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems
- The use of an SQP algorithm in slope stability analysis
- A sub-feasible correction step for non-linear programming methods with equality constraints
This page was built for publication: A feasible SQP method for nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266975)
