A unified class of directly solvable semidefinite programming problems

DOI10.1007/s10479-004-5025-yzbMath1119.90037OpenAlexW2059854915MaRDI QIDQ1772965

Masakazu Muramatsu

Publication date: 22 April 2005

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-004-5025-y

zbMATH Keywords

semidefinite programmingdirectly solvable SDPthe simplest SDP

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Related Items (2)

Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs ⋮ Solving SDP completely with an interior point oracle

Cites Work

• Explicit solutions for interval semidefinite linear programs
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• The Simplest Semidefinite Programs are Trivial
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A unified class of directly solvable semidefinite programming problems