A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms
From MaRDI portal
Publication:6041108
DOI10.1007/s10107-022-01891-8zbMath1519.90159arXiv1912.09696OpenAlexW2996684418MaRDI QIDQ6041108
Masakazu Muramatsu, Bruno F. Lourenço, Takayuki Okuno, Takashi Tsuchiya
Publication date: 25 May 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.09696
perturbationregularizationsingular problemssemidefinite programsinfeasible interior-point algorithmsnonzero duality gaps
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Interior-point methods (90C51)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facial reduction algorithms for conic optimization problems
- Regularizing the abstract convex program
- 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
- A relaxed-certificate facial reduction algorithm based on subspace intersection
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
- Perturbation analysis of singular semidefinite programs and its applications to control problems
- Amenable cones: error bounds without constraint qualifications
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Bad Semidefinite Programs: They All Look the Same
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- On the Nesterov--Todd Direction in Semidefinite Programming
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Strong Duality for Semidefinite Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Error Bounds for Linear Matrix Inequalities
- Facial Reduction and Partial Polyhedrality
- A framework for solving mixed-integer semidefinite programs
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
- Solving SDP completely with an interior point oracle
- Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
- Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2
- Foundations of Optimization
- A STRUCTURAL GEOMETRICAL ANALYSIS OF WEAKLY INFEASIBLE SDPS
- Duality and asymptotic solvability over cones
- Preprocessing and Regularization for Degenerate Semidefinite Programs
- Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
- Error Bounds and Singularity Degree in Semidefinite Programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
