Preprocessing and regularization for degenerate semidefinite programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3121284 (Why is no real title available?)
- scientific article; zbMATH DE number 3711742 (Why is no real title available?)
- scientific article; zbMATH DE number 3728055 (Why is no real title available?)
- scientific article; zbMATH DE number 3737415 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 679862 (Why is no real title available?)
- scientific article; zbMATH DE number 741106 (Why is no real title available?)
- scientific article; zbMATH DE number 1163814 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 1534296 (Why is no real title available?)
- scientific article; zbMATH DE number 3399051 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A mathematical view of interior-point methods in convex optimization
- A robust algorithm for semidefinite programming
- Advanced preprocessing techniques for linear and quadratic programming
- An exact duality theory for semidefinite programming and its complexity implications
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Bad semidefinite programs: they all look the same
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
- CSDP, A C library for semidefinite programming
- Calculating the cone of directions of constancy
- Complementarity and nondegeneracy in semidefinite programming
- Complexity of convex optimization using geometry-based measures and a reference point
- Computational experience with ill-posed problems in semidefinite programming
- Computing approximate solutions for convex conic systems of constraints
- Conic convex programming and self-dual embedding
- Critical angles in polyhedral convex cones: Numerical and statistical considerations
- Duality and asymptotic solvability over cones
- Efficient use of semidefinite programming for selection of rotamers in protein conformations
- Explicit sensor network localization using semidefinite representations and facial reductions
- First Order Conditions for General Nonlinear Optimization
- Generating and measuring instances of hard semidefinite programs
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- New stopping criteria for detecting infeasibility in conic optimization
- Numerical decomposition of a convex function
- On Zero Duality Gap and the Farkas Lemma for Conic Programming
- On duality gap in linear conic problems
- On duality theory of conic linear problems.
- On the Closedness of the Linear Image of a Closed Convex Cone
- On the Slater condition for the SDP relaxations of nonconvex sets
- Polyhedral and semidefinite programming methods in combinatorial optimization
- Preprocessing for quadratic programming
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Rank Degeneracy
- Redundancy in mathematical programming. A state-of-the-art survey
- Regularization methods for semidefinite programming
- Regularizing the abstract convex program
- Searching for critical angles in a convex cone
- Semidefinite Programming
- Semidefinite optimization
- Semidefinite programming relaxations for the graph partitioning problem
- Semidefinite programming relaxations for the quadratic assignment problem
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Solving semidefinite programs using preconditioned conjugate gradients
- Solving semidefinite-quadratic-linear programs using SDPT3
- Some applications of optimization in matrix theory
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Strong Duality for Semidefinite Programming
- Strong duality and minimal representations for cone optimization
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(18)- Douglas-Rachford splitting and ADMM for pathological convex optimization
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms
- Amenable cones: error bounds without constraint qualifications
- On the sensitivity of the optimal partition for parametric second-order conic optimization
- A structural geometrical analysis of weakly infeasible SDPS
- On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
- Strong duality and minimal representations for cone optimization
- Computational experience with ill-posed problems in semidefinite programming
- A minimal face constant rank constraint qualification for reducible conic programming
- Error bounds and singularity degree in semidefinite programming
- Preprocessing sparse semidefinite programs via matrix completion
- Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
- Solving SDP completely with an interior point oracle
- A note on alternating projections for ill-posed semidefinite feasibility problems
- A relaxed-certificate facial reduction algorithm based on subspace intersection
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Facial reduction and partial polyhedrality
This page was built for publication: Preprocessing and regularization for degenerate semidefinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746441)
