On Degenerate Doubly Nonnegative Projection Problems
Ying Cui, Ling Liang, Defeng Sun, Kim-Chuan Toh

TL;DR
This paper develops an augmented Lagrangian method to efficiently compute projections onto the doubly nonnegative cone, overcoming degeneracy issues that hinder traditional Newton-type methods, and demonstrates high-accuracy results on challenging instances.
Contribution
It introduces a novel ALM-based approach that handles degeneracy in DNN projection problems, ensuring superlinear convergence and high accuracy.
Findings
Effective on large-scale, difficult instances
Achieves high-precision projections
Demonstrates superlinear convergence behavior
Abstract
The doubly nonnegative (DNN) cone, being the set of all positive semidefinite matrices whose elements are nonnegative, is a popular approximation of the computationally intractable completely positive cone. The major difficulty for implementing a Newton-type method to compute the projection of a given large scale matrix onto the DNN cone lies in the possible failure of the constraint nondegeneracy, a generalization of the linear independence constraint qualification for nonlinear programming. Such a failure results in the singularity of the Jacobian of the nonsmooth equation representing the Karush-Kuhn-Tucker optimality condition that prevents the semismooth Newton-CG method from solving it with a desirable convergence rate. In this paper, we overcome the aforementioned difficulty by solving a sequence of better conditioned nonsmooth equations generated by the augmented Lagrangian…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Sparse and Compressive Sensing Techniques · Optimization and Variational Analysis
