|
An Approximate Method for Convex Programming
Jaromir Abrham
Abstract
An iterative method for solving nonlinear programming problems is proposed. Its convergence is proved for the case in which the minimand is strictly convex. An upper bound for the error at each step is given.
|
