A simplified treatment of Ramana's exact dual for semidefinite programming

DOI10.1007/S11590-022-01898-2MaRDI QIDQ2688906zbMATH OpenOpenAlexFDO

Authors Bruno F. Lourenço, Gábor Pataki

Publication date 6 March 2023

Published in Optimization Letters (Search for Journal in Brave)

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

zbMATH Keywords

dualityduality gapfacial reductionRamana's dualsemidefinite programming

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Inequalities and extremum problems involving convexity in convex geometry (52A40) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• An exact duality theory for semidefinite programming and its complexity implications
• An exact duality theory for semidefinite programming based on sums of squares
• Exact Duality in Semidefinite Programming Based on Elementary Reformulations
• A variant of the dual simplex method for a linear semidefinite programming problem
• A new duality for semidefinite multiplicative programming
• A Dual Approach to Semidefinite Least-Squares Problems
• Duality formulations in semidefinite programming
• The conjugate duality of nonlinear semidefinite programming
• Simpler semidefinite programs for completely bounded norms
• scientific article; zbMATH DE number 1552283

Cites work

• A mathematical view of interior-point methods in convex optimization
• A structural geometrical analysis of weakly infeasible SDPS
• Advances in convex optimization: conic programming
• An exact duality theory for semidefinite programming and its complexity implications
• An exact duality theory for semidefinite programming based on sums of squares
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Bad semidefinite programs: they all look the same
• Characterizing bad semidefinite programs: normal forms and short proofs
• Convex Analysis
• Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
• Facial reduction algorithms for conic optimization problems
• Graphs and geometry
• scientific article; zbMATH DE number 3728055 (Why is no real title available?)
• scientific article; zbMATH DE number 1534291 (Why is no real title available?)
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
• Regularizing the abstract convex program
• Semidefinite Programming
• Semidefinite programming and integer programming
• Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
• SOS is not obviously automatizable, even approximately
• Strong Duality for Semidefinite Programming

Cited in

(5)

• An exact duality theory for semidefinite programming and its complexity implications
• The RPR2 rounding technique for semidefinite programs
• Exact Duality in Semidefinite Programming Based on Elementary Reformulations
• Strong duality in conic linear programming: facial reduction and extended duals
• A Simplified Treatment of Ramana's Exact Dual for Semidefinite Programming

Describes a project that uses

Uses Software

• frlib

This page was built for publication: A simplified treatment of Ramana's exact dual for semidefinite programming

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