On Degenerate Doubly Nonnegative Projection Problems
From MaRDI portal
Publication:5868954
DOI10.1287/moor.2021.1205zbMath1501.90045arXiv2009.11272OpenAlexW4205161053MaRDI QIDQ5868954
Ling Liang, Ying Cui, Kim-Chuan Toh, Defeng Sun
Publication date: 26 September 2022
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.11272
semidefinite programmingdegeneracyaugmented Lagrangian methodmetric subregularitydoubly nonnegative conesemismooth Newton
Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- On the computational complexity of membership problems for the completely positive cone and its dual
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Norms and exclusion theorems
- Copositive and semidefinite relaxations of the quadratic assignment problem
- A simple characterization of solutions sets of convex programs
- A cyclic projection algorithm via duality
- Sensitivity analysis of generalized equations
- A unified approach to error bounds for structured convex optimization problems
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Approximation of the Stability Number of a Graph via Copositive Programming
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- An Algorithm for Restricted Least Squares Regression
- Implicit Functions and Solution Mappings
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- Some NP-complete problems in quadratic and nonlinear programming
- On the Matrix Equation X′X = A
- Some continuity properties of polyhedral multifunctions
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Combined Primal–Dual and Penalty Methods for Convex Programming
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Variational Analysis
- Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions
- On Projection Algorithms for Solving Convex Feasibility Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
- Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- A Copositive Programming Approach to Graph Partitioning
- ON MATRICES DEPENDING ON PARAMETERS
- Semismooth Matrix-Valued Functions
- Constraint Nondegeneracy in Variational Analysis
- On copositive programming and standard quadratic optimization problems
