Sequential penalty algorithm for nonlinear constrained optimization
From MaRDI portal
Publication:597213
DOI10.1023/B:JOTA.0000004875.49572.10zbMath1061.90108OpenAlexW2080917467MaRDI QIDQ597213
Publication date: 6 August 2004
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jota.0000004875.49572.10
global convergenceNonlinear optimizationsuperlinear convergenceSQP methodsequential penalty algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- A globally convergent algorithm for nonlinearly constrained optimization problems
- Test examples for nonlinear programming codes
- An algorithm for solving linearly constrained minimax problems
- A globally convergent method for nonlinear programming
- Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
- A SQP method for inequality constrained optimization.
- A robust sequential quadratic programming method
- A sequential quadratic programming method for potentially infeasible mathematical programs
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- A Robust Algorithm for Optimization with General Equality and Inequality Constraints
- A Global Convergence Analysis of an Algorithm for Large-Scale Nonlinear Optimization Problems
- A modified SQP method and its global convergence
- A globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization.
This page was built for publication: Sequential penalty algorithm for nonlinear constrained optimization
