A simple feasible SQP algorithm for inequality constrained optimization
DOI10.1016/J.AMC.2006.04.073zbMATH Open1111.65057OpenAlexW2146283958MaRDI QIDQ858743FDOQ858743
Authors: Zhibin Zhu
Publication date: 11 January 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.04.073
Recommendations
- An efficient feasible SQP algorithm for inequality constrained optimization
- A type of efficient feasible SQP algorithms for inequality constrained optimization
- An improved SQP algorithm for inequality constrained optimization
- A feasible equality constrained SQP algorithm for nonlinear optimization
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
- A feasible SQP algorithm with superlinear convergence for inequality constrained optimization
- A feasible SQP descent method for inequality constrained optimization problems and its convergence
- scientific article
- A variant of feasible descent SQP method for inequality constrained optimization
- An Inexact SQP Method for Equality Constrained Optimization
global convergencesuperlinear convergencesequential quadratic programming methodsnonlinear constrained minimization
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30)
Cites Work
- A globally convergent method for nonlinear programming
- Test examples for nonlinear programming codes
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Exact penalty function algorithm with simple updating of the penalty parameter
- A computationally efficient feasible sequential quadratic programming algorithm
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- Title not available (Why is that?)
- A superlinearly convergent method of feasible directions.
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
- A sequential quadratic programming method for potentially infeasible mathematical programs
Cited In (22)
- An SQP algorithm for degenerate problems
- Title not available (Why is that?)
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
- Title not available (Why is that?)
- A type of efficient feasible SQP algorithms for inequality constrained optimization
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- A superlinear convergence feasible sequential quadratic programming algorithm for bipedal dynamic walking robot via discrete mechanics and optimal control
- A variant of SQP method for inequality constrained optimization and its global convergence
- An efficient feasible SQP algorithm for inequality constrained optimization
- A feasible equality constrained SQP algorithm for nonlinear optimization
- A modified strongly sub-feasible SQP algorithm for constrained optimization and numerical experiments
- An improved SQP algorithm for inequality constrained optimization
- A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
- A feasible SQP algorithm with superlinear convergence for inequality constrained optimization
- A feasible SQP descent method for inequality constrained optimization problems and its convergence
- An improved feasible QP-free algorithm for inequality constrained optimization
- Joint optimization of condition-based maintenance and production lot-sizing
- A feasible trust region SQP method with nonmonotone line search for inequality constrained optimization
- A superlinearly and quadratically convergent SQP algorithm for inequality constrained optimization.
- On the comparative optimal analysis and synthesis of four-bar function generating mechanism using different heuristic methods
- Title not available (Why is that?)
This page was built for publication: A simple feasible SQP algorithm for inequality constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858743)