A STRUCTURAL GEOMETRICAL ANALYSIS OF WEAKLY INFEASIBLE SDPS

DOI10.15807/JORSJ.59.241zbMath1357.90113arXiv1507.06843OpenAlexW2963216318MaRDI QIDQ5507009

Bruno F. Lourenço, Takashi Tsuchiya, Masakazu Muramatsu

Publication date: 16 December 2016

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.06843

zbMATH Keywords

optimizationsemidefinite programmingweak infeasibility

Mathematics Subject Classification ID

Semidefinite programming (90C22) Pattern recognition, speech recognition (68T10)

Related Items (12)

Facial Reduction and Partial Polyhedrality ⋮ A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms ⋮ A simplified treatment of Ramana's exact dual for semidefinite programming ⋮ How Do Exponential Size Solutions Arise in Semidefinite Programming? ⋮ Bad Semidefinite Programs: They All Look the Same ⋮ Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming ⋮ Weak infeasibility in second order cone programming ⋮ Conic programming: infeasibility certificates and projective geometry ⋮ Perturbation analysis of singular semidefinite programs and its applications to control problems ⋮ Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs ⋮ Solving SDP completely with an interior point oracle ⋮ Exact Duality in Semidefinite Programming Based on Elementary Reformulations

This page was built for publication: A STRUCTURAL GEOMETRICAL ANALYSIS OF WEAKLY INFEASIBLE SDPS