A Family of Descent Functions for Constrained Optimization

DOI10.1137/0721071MaRDI QIDQ3694575zbMATH OpenOpenAlexFDO

Authors Paul T. Boggs, Jon W. Tolle

Publication date 1984

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0721071

zbMATH Keywords

equality constrained nonlinear programmingline searchmerit functionpenalty functionsQ-superlinear convergencequasi-Newton methodssequential quadratic programming algorithmsteplength

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cited in

(10)

• A sparse sequential quadratic programming algorithm
• Sequential quadratic programming for certain parameter identification problems
• A new successive quadratic programming algorithm
• A characterization of families of function sets described by constraints on the gradient
• An analysis of reduced Hessian methods for constrained optimization
• scientific article; zbMATH DE number 3843510 (Why is no real title available?)
• scientific article; zbMATH DE number 4047449 (Why is no real title available?)
• A primal-dual augmented Lagrangian
• An adaptive augmented Lagrangian method for large-scale constrained optimization
• Projected quasi-Newton algorithm with trust region for constrained optimization

This page was built for publication: A Family of Descent Functions for Constrained Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694575)