We present two strategies for choosing a "hot" starting-point in the context of an infeasible Potential Reduction (PR) method for convex Quadratic Programming. The basic idea of both strategies is to select a preliminary point and to suitably scale it in order to obtain a starting point such that its nonnegative entries are sufficiently bounded away from zero, and the ratio between the duality gap and a suitable measure of the infeasibility is small. One of the two strategies is naturally suggested by the convergence theory of the PR method; the other has been devised to reduce the initial values of the duality gap and the infeasibility measure, with the objective of decreasing the number of PR iterations. Numerical experiments show that the second strategy generally performs better than the first, and both outperform a starting-point strategybased on the affine-scaling step.

## Citation

Preprint n. 2/2009, Department of Mathematics, Second University of Naples, via Vivaldi, 43, I-81100 Caserta, Italy, June, 2009

## Article

View Starting-Point Strategies for an Infeasible Potential Reduction Method