The Simplest Semidefinite Programs are Trivial

DOI10.1287/MOOR.20.3.590MaRDI QIDQ4864874zbMATH OpenOpenAlexFDO

Authors Robert J. Vanderbei, Bing Yang

Publication date 7 October 1996

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/0fa113e5187c499595e7db243310ea3ba9c7d987

zbMATH Keywords

branch and bound algorithmsmin-max eigenvalue problemssemidefinite programming problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Recommendations

• Semidefinite Programming
• A Spectral Bundle Method for Semidefinite Programming
• Semidefinite programming
• Semidefinite programming
• scientific article; zbMATH DE number 1031414

Cited in

(5)

• A unified class of directly solvable semidefinite programming problems
• Explicit solutions for interval semidefinite linear programs
• Solving SDP completely with an interior point oracle
• Simpler semidefinite programs for completely bounded norms
• Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs

This page was built for publication: The Simplest Semidefinite Programs are Trivial

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