Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization
From MaRDI portal
Publication:480926
DOI10.1007/s10589-014-9675-7zbMath1310.90107OpenAlexW1967337303MaRDI QIDQ480926
Lei-Hong Zhang, Bo Wang, Chungen Shen, Wen-Qiong Shao
Publication date: 12 December 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-014-9675-7
Related Items (2)
On a globally convergent trust region algorithm with infeasibility control for equality constrained optimization ⋮ A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem
Uses Software
Cites Work
- A line search exact penalty method using steering rules
- A nonmonotone filter method for nonlinear optimization
- A relaxed constant positive linear dependence constraint qualification and applications
- Nonlinear programming without a penalty function or a filter
- A penalty-function-free line search SQP method for nonlinear programming
- Test examples for nonlinear programming codes
- A globally convergent method for nonlinear programming
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- Stabilized sequential quadratic programming
- Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
- Constraint identification and algorithm stabilization for degenerate nonlinear programs
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- A robust sequential quadratic programming method
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A sequential quadratic programming algorithm with an additional equality constrained phase
- A Second Derivative SQP Method: Global Convergence
- A Second Derivative SQP Method: Local Convergence and Practical Issues
- Sharp Primal Superlinear Convergence Results for Some Newtonian Methods for Constrained Optimization
- A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
- Dynamic Control of Infeasibility in Equality Constrained Optimization
- On uniqueness of Kuhn-Tucker multipliers in nonlinear programming
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- CUTE
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Degenerate Nonlinear Programming with a Quadratic Growth Condition
- A Nonmonotone Line Search Technique for Newton’s Method
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- On the Global Convergence of a Filter--SQP Algorithm
- Modifying SQP for Degenerate Problems
- Second-order Sufficiency and Quadratic Growth for Nonisolated Minima
- A Sequential Linear Constraint Programming Algorithm for NLP
- An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- A modified SQP method and its global convergence
- A modified SQP method with nonmonotone linesearch technique.
- Benchmarking optimization software with performance profiles.
- Nonlinear programming without a penalty function.
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization
