A potential reduction algorithm is proposed for optimization of a convex function subject to linear constraints.At each step of the algorithm,a system of linear equations is solved to get a search direction and the Armijo’s rule is used to determine a stepsize.It is proved that the algorithm is globally convergent.Computational results are reported.
展开▼