A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence
From MaRDI portal
Publication:1370303
DOI10.1007/s11766-997-0035-6zbMath0888.90133OpenAlexW2330307389MaRDI QIDQ1370303
Publication date: 25 May 1998
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-997-0035-6
Related Items (4)
A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity ⋮ An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity ⋮ A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity ⋮ A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A superlinearly convergent algorithm of the sequential systems of linear equations for nonlinear optimization problems
- A successive quadratic programming algorithm with global and superlinear convergence properties
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A surperlinearly convergent algorithm for constrained optimization problems
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
This page was built for publication: A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence