On finding a generalized lowest rank solution to a linear semi-definite feasibility problem

DOI10.1016/J.ORL.2015.04.003MaRDI QIDQ1785372zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Chee-Khian Sim

Publication date 28 September 2018

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://researchportal.port.ac.uk/portal/en/publications/on-finding-a-generalized-lowest-rank-solution-to-a-linear-semidefinite-feasibility-problem(af3ad478-7d2f-4026-a44b-978fd5bdf6ed).html

zbMATH Keywords

affine rank minimization problemconcave minimization problemvector cardinality minimization problem

Mathematics Subject Classification ID

Vector spaces, linear dependence, rank, lineability (15A03) Semidefinite programming (90C22)

Recommendations

• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Two relaxation methods for rank minimization problems
• scientific article; zbMATH DE number 1059231
• An approximation theory of matrix rank minimization and its application to quadratic equations
• On generalized matrix approximation problem in the spectral norm

Cites work

• A note on the complexity of \(L _{p }\) minimization
• An approximation theory of matrix rank minimization and its application to quadratic equations
• Concave programming for minimizing the zero-norm over polyhedral sets
• Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
• Convex Analysis
• Decoding by Linear Programming
• Deterministic algorithms for constrained concave minimization: A unified critical survey
• Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
• Group Invariance and Convex Matrix Analysis
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Methods for Global Concave Minimization: A Bibliographic Survey
• Nonsmooth analysis of eigenvalues
• Reweighted _1-minimization for sparse solutions to underdetermined linear systems

Cited in

(1)

• Finding a strict feasible solution of a linear semidefinite program

This page was built for publication: On finding a generalized lowest rank solution to a linear semi-definite feasibility problem

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