Optimization methods & software · 1995 · 71 citations · 17 references
Natural SciencesMathematicsComputational GeometryComputational MechanicsOptimizationConstrained OptimizationConvex OptimizationGradient-based OptimizationLarge-scale OptimizationOptimization TheoryUnconstrained OptimizationConvex Quadratic ProgrammingLarge-scale Convex OptimizationMinimization
In this paper, we present a new method for minimizing a convex quadratic function of many variables with box constraints. The new algorithm is a modification of a method introduced recently by Friedlander and Martinez {SIAM J. on Optimization, February 1994). Following the lines of More and Toraldo (SIAM J. on Optimization 1, pp. 93-113), it combines an efficient unconstrained method with gradient projection techniques. The strategy for “leaving the current face” makes it possible to obtain convergence even when the Hessian is singular. Dual nondegeneracy is not assumed anywhere. The unconstrained minimization algorithm used within the faces was introduced by Barzilai and Borwein and analyzed by Raydan (IMA Journal of Numerical Analysis13, pp. 321-326)
17
Practical methods of optimization
Mathematics and Computers in Simulation · 1988 · 5.9K citations
Reuven R. Levary · European Journal of Operational Research · 1982 · 4.2K citations
Practical Methods of Optimization.
Christoph Witzgall, R. Fletcher · Mathematics of Computation · 1989 · 3.6K citations
Two-Point Step Size Gradient Methods
Jonathan Barzilai, Jonathan M. Borwein · IMA Journal of Numerical Analysis · 1988 · 2.9K citations