Augmented Lagrangian nonlinear programming algorithm that uses SQP and trust region techniques

DOI10.1007/BF02192082zbMath0838.90112OpenAlexW1970790844MaRDI QIDQ1905035

Yanyan Li

Publication date: 11 February 1996

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02192082

zbMATH Keywords

global convergencesequential quadratic programmingtrust regionKuhn-Tucker multipliersinner loopouter loopaugmented Lagrangian nonlinear programming algorithmfast local convergencemiddle loop

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (1)

A practical optimality condition without constraint qualifications for nonlinear programming

Uses Software

• NPSOL

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel orthogonal factorization null-space method for dynamic quadratic programming
• Multiplier and gradient methods
• Nonlinear programming via an exact penalty function: Asymptotic analysis
• Application of sparse nonlinear programming to trajectory optimization
• Trajectory optimization on a parallel processor

This page was built for publication: Augmented Lagrangian nonlinear programming algorithm that uses SQP and trust region techniques