Related references
Note: Only part of the references are listed.Structured low-rank approximation and its applications
Ivan Markovsky
AUTOMATICA (2008)
A Simple Proof of the Restricted Isometry Property for Random Matrices
Richard Baraniuk et al.
CONSTRUCTIVE APPROXIMATION (2008)
Enhancing Sparsity by Reweighted l1 Minimization
Emmanuel J. Candes et al.
JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS (2008)
Exact reconstruction of sparse signals via nonconvex minimization
Rick Chartrand
IEEE SIGNAL PROCESSING LETTERS (2007)
Sparsity and incoherence in compressive sampling
Emmanuel Candes et al.
INVERSE PROBLEMS (2007)
Portfolio optimization with linear and fixed transaction costs
Miguel Sousa Lobo et al.
ANNALS OF OPERATIONS RESEARCH (2007)
A Newton-like method for solving rank constrained linear matrix inequalities
Robert Orsi et al.
AUTOMATICA (2006)
Stable signal recovery from incomplete and inaccurate measurements
Emmanuel J. Candes et al.
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS (2006)
Compressed sensing
DL Donoho
IEEE TRANSACTIONS ON INFORMATION THEORY (2006)
On the largest principal angle between random subspaces
PA Absil et al.
LINEAR ALGEBRA AND ITS APPLICATIONS (2006)
Robust uncertainty principles:: Exact signal reconstruction from highly incomplete frequency information
EJ Candès et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2006)
Jordan-algebraic approach to convexity theorems for quadratic mappings
L. Faybusovich
SIAM JOURNAL ON OPTIMIZATION (2006)
Decoding by linear programming
EJ Candes et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2005)
Sparse nonnegative solution of underdetermined linear equations by linear programming
DL Donoho et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2005)
Neighborliness of randomly projected simplices in high dimensions
DL Donoho et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2005)
Local minima and convergence in low-rank semidefinite programming
S Burer et al.
MATHEMATICAL PROGRAMMING (2005)
The mathematics of eigenvalue optimization
AS Lewis
MATHEMATICAL PROGRAMMING (2003)
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
D Achlioptas
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2003)
Mirror descent and nonlinear projected subgradient methods for convex optimization
A Beck et al.
OPERATIONS RESEARCH LETTERS (2003)
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
S Burer et al.
MATHEMATICAL PROGRAMMING (2003)
An elementary proof of a theorem of Johnson and Lindenstrauss
S Dasgupta et al.
RANDOM STRUCTURES & ALGORITHMS (2003)
Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones
SH Schmieta et al.
MATHEMATICS OF OPERATIONS RESEARCH (2001)
An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory
B Fares et al.
INTERNATIONAL JOURNAL OF CONTROL (2001)
Nonlinear dimensionality reduction by locally linear embedding
ST Roweis et al.
SCIENCE (2000)
A global geometric framework for nonlinear dimensionality reduction
JB Tenenbaum et al.
SCIENCE (2000)
Distance matrix completion by numerical optimization
MW Trosset
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2000)
On cone-invariant linear matrix inequalities
PA Parrilo et al.
IEEE TRANSACTIONS ON AUTOMATIC CONTROL (2000)
A new approach to variable selection in least squares problems
MR Osborne et al.
IMA JOURNAL OF NUMERICAL ANALYSIS (2000)
Share Paper
