A class of semidefinite programs with rank-one solutions

DOI10.1016/j.laa.2011.03.027zbMath1220.90084arXiv0909.5577OpenAlexW2130532371MaRDI QIDQ551300

Guillaume Sagnol

Publication date: 15 July 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

SDPoptimal experimental designSOCPlow-rank solutionsmultiresponse experimentsrank-one solutionsemidefinite packing problem

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Semidefinite programming (90C22)

Related Items (4)

Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming ⋮ On the semidefinite representation of real functions applied to symmetric matrices ⋮ Tightness of the maximum likelihood semidefinite relaxation for angular synchronization ⋮ The analysis of multivariate data using semi-definite programming

Uses Software

• SeDuMi
• SDPLR
• DSPCA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming
• On linear regression designs which maximize information
• Problems of distance geometry and convex properties of quadratic maps
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• On maximization of quadratic form over intersection of ellipsoids with common center
• Local minima and convergence in low-rank semidefinite programming
• On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
• Approximating Semidefinite Packing Programs
• Approximate graph coloring by semidefinite programming
• On the Shannon capacity of a graph
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Determinant Maximization with Linear Matrix Inequality Constraints
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• A Direct Formulation for Sparse PCA Using Semidefinite Programming
• Expander flows, geometric embeddings and graph partitioning

This page was built for publication: A class of semidefinite programs with rank-one solutions