An efficient algorithm for minimizing barrier and penalty functions

DOI10.1007/BF01584537zbMath0247.90056MaRDI QIDQ5661720

L. S. Lasdon

Publication date: 1972

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (6)

A hadamard-stable extension of courant's sequential method for convex extremal problems ⋮ On “an efficient algorithm for minimizing barrier and penalty functions” ⋮ An efficient one—dimensional search procedure for barrier functions ⋮ An efficient cyclic coordinate method for optimizing penalty functions ⋮ Minimization methods with constraints ⋮ A stable interior penalty method for convex extremal problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A duality theorem for non-linear programming
• An Algorithm for Least-Squares Estimation of Nonlinear Parameters
• Nonlinear Programming: A Numerical Survey
• On Non‐Linear Ordinary Differential Equations of Boundary Layer Type
• A New Method for Constrained Optimization Problems
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
• An algorithm for solving nonlinear programming problems subject to nonlinear inequality constraints
• Comparison of Gradient Methods for the Solution of Nonlinear Parameter Estimation Problems
• Variable metric methods of minimisation
• The Variable Reduction Method for Nonlinear Programming

This page was built for publication: An efficient algorithm for minimizing barrier and penalty functions