Closing duality gaps of SDPs completely through perturbation when singularity degree is one

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Facial reduction algorithms for conic optimization problems
An exact duality theory for semidefinite programming and its complexity implications
Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
Cones of diagonally dominant matrices
How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
Amenable cones: error bounds without constraint qualifications
Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
Strong Duality for Semidefinite Programming
Error Bounds for Linear Matrix Inequalities
Facial Reduction and Partial Polyhedrality
Solving SDP completely with an interior point oracle
Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
A STRUCTURAL GEOMETRICAL ANALYSIS OF WEAKLY INFEASIBLE SDPS
Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
Handbook of semidefinite programming. Theory, algorithms, and applications
A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms
Error bounds, facial residual functions and applications to the exponential cone
How Do Exponential Size Solutions Arise in Semidefinite Programming?
An echelon form of weakly infeasible semidefinite programs and bad projections of the psd cone

This page was built for publication: Closing duality gaps of SDPs completely through perturbation when singularity degree is one

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644993)