Preprocessing and Regularization for Degenerate Semidefinite Programs
From MaRDI portal
Publication:5746441
DOI10.1007/978-1-4614-7621-4_12zbMath1288.90060OpenAlexW36849672MaRDI QIDQ5746441
Yuen-Lam Cheung, Henry Wolkowicz, Simon P. Schurr
Publication date: 18 February 2014
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-7621-4_12
Semidefinite programming (90C22) Convex programming (90C25) Sensitivity, stability, well-posedness (49K40) Numerical optimization and variational techniques (65K10)
Related Items
Strong duality and minimal representations for cone optimization, Facial Reduction and Partial Polyhedrality, A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms, A relaxed-certificate facial reduction algorithm based on subspace intersection, Amenable cones: error bounds without constraint qualifications, On the sensitivity of the optimal partition for parametric second-order conic optimization, A note on alternating projections for ill-posed semidefinite feasibility problems, Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone, Douglas-Rachford splitting and ADMM for pathological convex optimization, Solving SDP completely with an interior point oracle, Error Bounds and Singularity Degree in Semidefinite Programming, On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization, Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
- Solving semidefinite-quadratic-linear programs using SDPT3
- Redundancy in mathematical programming. A state-of-the-art survey
- Polyhedral and semidefinite programming methods in combinatorial optimization
- On duality gap in linear conic problems
- Numerical decomposition of a convex function
- Critical angles in polyhedral convex cones: Numerical and statistical considerations
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
- Searching for critical angles in a convex cone
- New stopping criteria for detecting infeasibility in conic optimization
- Regularizing the abstract convex program
- Some applications of optimization in matrix theory
- Calculating the cone of directions of constancy
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Complementarity and nondegeneracy in semidefinite programming
- An exact duality theory for semidefinite programming and its complexity implications
- Semidefinite programming relaxations for the quadratic assignment problem
- Advanced preprocessing techniques for linear and quadratic programming
- Complexity of convex optimization using geometry-based measures and a reference point
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Computing approximate solutions for convex conic systems of constraints
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- On the Slater condition for the SDP relaxations of nonconvex sets
- Preprocessing for quadratic programming
- Strong duality and minimal representations for cone optimization
- Generating and measuring instances of hard semidefinite programs
- Semidefinite programming relaxations for the graph partitioning problem
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Efficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations
- Bad Semidefinite Programs: They All Look the Same
- On Zero Duality Gap and the Farkas Lemma for Conic Programming
- Semidefinite optimization
- Rank Degeneracy
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- First Order Conditions for General Nonlinear Optimization
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
- Strong Duality for Semidefinite Programming
- CSDP, A C library for semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Conic convex programming and self-dual embedding
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Semidefinite Programming
- Regularization Methods for Semidefinite Programming
- A robust algorithm for semidefinite programming
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- On the Closedness of the Linear Image of a Closed Convex Cone
- Solving semidefinite programs using preconditioned conjugate gradients
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Duality and asymptotic solvability over cones
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Computational experience with ill-posed problems in semidefinite programming
