A parameter-free multiplier method for constrained minimization problems

DOI10.1016/0377-0427(88)90277-4zbMath0652.65052OpenAlexW2036565822MaRDI QIDQ1107278

S. H. Smith

Publication date: 1988

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(88)90277-4

zbMATH Keywords

computational algorithmmultiplier methodssteepest descentconstrained minimizationaugmented Lagrangian methodsnonlinear programming methodpenalty function methodsdifferential trajectory

Mathematics Subject Classification ID

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

Cites Work

• Multiplier methods: A survey
• Multiplier and gradient methods
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A parameter-free multiplier method for constrained minimization problems