On the rank minimization problem over a positive semidefinite linear matrix inequality
IEEE Transactions on Automatic ControlPublished 1 January 1997Open access
Mehran Mesbahi, George P. Papavassilopoulos
Citations189
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
We consider the problem of minimizing the rank of a positive semidefinite matrix, subject to the constraint that an affine transformation of it is also positive semidefinite. Our method for solving this problem employs ideas from the ordered linear complementarity theory and the notion of the least element in a vector lattice. This problem is of importance in many contexts,
Keywords
Computer ScienceMathematicsEngineering
Matrix Analysis
22,234 Citations1985Roger A. Horn, Charles R. Johnson
Cambridge University Press eBooksMatrix Analysis
10,056 Citations1985Roger A. Horn, Charles R. Johnson
Society for Industrial and Applied Mathematics eBooksThe Linear Complementarity Problem
2,810 Citations2009Richard W. Cottle, Jong‐Shi Pang +1 more
Journal of the Royal Statistical Society Series A (Statistics in Society)The Linear Complementarity Problem.
1,165 Citations1993M. E. B. Brigden, Richard W. Cottle +2 more
SIAM Journal on OptimizationInterior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
891 Citations1995Farid Alizadeh
It is argued that many known interior point methods for linear programs can be transformed in a mechanical way to algorithms for SDP with proofs of convergence and polynomial time complexity carrying over in a similar fashion.
Control system synthesis via bilinear matrix inequalities
197 Citations2005Michael G. Safonov, Kai Chen Goh +1 more
The BMI formulation is shown to offer the advantage of handling specifications not amenable to the LMI framework such as constraints on controller structure and on controller order, raising questions about the local optimality of the classical DK-iteration.
Rank Minimization under LMI constraints: A Framework for Output Feedback Problems
81 Citations1993Laurent El Ghaoui, Pascal Gahinet
This paper proposes a single framework for addressing a number of output feedback stabilization problems for LTI systems, including static output Feedback stabilization, dynamic reduced-order output-feedback stabilization, reduced- order H 1 synthesis and synthesis with constant scalings.
Solving a class of rank minimization problems via semi-definite programs, with applications to the fixed order output feedback synthesis
18 Citations1997Mehran Mesbahi, G.P. Papvassiloupoulos
Mathematical ProgrammingA cone programming approach to the bilinear matrix inequality problem and its geometry
16 Citations1997Mehran Mesbahi, George P. Papavassilopoulos
It is shown that solving a given BMI is equivalent to examining the solution set of a suitably constructed Cone-LP or COne-LCP.