A unified class of directly solvable semidefinite programming problems

DOI10.1007/S10479-004-5025-YMaRDI QIDQ1772965zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A class of semidefinite programs with rank-one solutions
• Solving semidefinite programming problems via alternating direction methods
• Regularization methods for semidefinite programming
• Semidefinite Programming
• scientific article; zbMATH DE number 1031414

Cites work

• scientific article; zbMATH DE number 715155 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 1390210 (Why is no real title available?)
• Explicit solutions for interval semidefinite linear programs
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• The Simplest Semidefinite Programs are Trivial

Cited in

(5)

• A class of semidefinite programs with rank-one solutions
• \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications
• Solving SDP completely with an interior point oracle
• A unified framework for a class of mathematical programming problems
• Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs

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

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