Exploiting sparsity in the matrix-dilation approach to robust semidefinite programming

DOI10.15807/JORSJ.52.321MaRDI QIDQ3647393zbMATH OpenOpenAlexFDO

Authors Yasuaki Oishi, Yusuke Isaka

Publication date 30 November 2009

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

Full work available at URL https://doi.org/10.15807/jorsj.52.321

zbMATH Keywords

linear matrix inequalitiesmatrix dilationoptimizationrectilinear Steiner arborescencesrobust semidefinite programmingsparsity

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Recommendations

• Exploiting structured sparsity in large scale semidefinite programming problems
• Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
• Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
• Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity

Cited in

(3)

• Stability and robustness of \(\ell_1\)-minimizations with Weibull matrices and redundant dictionaries
• Applications of gauge duality in robust principal component analysis and semidefinite programming
• Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations

Describes a project that uses

Uses Software

• YALMIP
• SeDuMi

This page was built for publication: Exploiting sparsity in the matrix-dilation approach to robust semidefinite programming

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