Projection onto a Polyhedron that Exploits Sparsity

  title={Projection onto a Polyhedron that Exploits Sparsity},
  author={William W. Hager and Hongchao Zhang},
  journal={SIAM Journal on Optimization},
An algorithm is developed for projecting a point onto a polyhedron. The algorithm solves a dual version of the projection problem and then uses the relationship between the primal and dual to recover the projection. The techniques in the paper exploit sparsity. SpaRSA (Sparse Reconstruction by Separable Approximation) is used to approximately identify active constraints in the polyhedron, and the Dual Active Set Algorithm (DASA) is used to compute a high precision solution. A linear convergence… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 56 references

A nonmonotone line search technique for Newton’s method

L. Grippo, F. Lampariello, S. Lucidi
SIAM J. Numer. Anal., 23 • 1986
View 5 Excerpts
Highly Influenced

Algorithm 887: CHOLMOD

Y. Chen, T. A. Davis, W. W. Hager, S. Rajamanickam
supernodal sparse Cholesky factorization and update/downdate, ACM Trans. Math. Software, 35 • 2009
View 6 Excerpts
Highly Influenced

Sparse Reconstruction by Separable Approximation

IEEE Transactions on Signal Processing • 2008
View 5 Excerpts
Highly Influenced

An algorithm for quadratic l1-regularized optimization with a flexible active-set strategy

R. H. Byrd, J. Nocedal, S. Solntsev
tech. rep., Northwestern University, March 27 • 2014
View 1 Excerpt

Similar Papers

Loading similar papers…