An exterior point method for the convex programming problem

DOI10.1007/BF00939949zbMath0793.90051OpenAlexW1999823859MaRDI QIDQ1321136

Jan Frederick Andrus

Publication date: 27 April 1994

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

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

zbMATH Keywords

proof of convergencegradient projections

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (2)

On using exterior penalty approaches for solving linear programming problems ⋮ An exterior-point method for linear programming problems

Cites Work

• Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes
• A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
• Unnamed Item
• Unnamed Item

This page was built for publication: An exterior point method for the convex programming problem