See this document in CiteSeerX!

A Semidefinite Representation for some Minimum Cardinality Problems (2003)  (Make Corrections)  
Alexandre d'Aspremont



  Home/Search   Context   Related

 
View or download:
stanford.edu/~aspremo...SparsitySDP.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  stanford.edu/~aspremon/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Using techniques developed in [Las02], we show that some minimum cardinality problems subject to linear inequalities can be represented as finite sequences of semidefinite programs. In particular, we provide a semidefinite representation of the minimum rank problem on positive semidefinite matrices. We also use this technique to cast the problem of finding convex lower bounds on the objective as a semidefinite program. (Update)

Similar documents (at the sentence level):
48.8%:   Shape Constrained Optimization with Applications in Finance and .. - d'Aspremont (2004)   (Correct)

Active bibliography (related documents):   More   All
0.8:   A Harmonic Analysis Solution to the Static Basket Arbitrage.. - d'Aspremont (2003)   (Correct)
0.5:   Global Optimization with Polynomials and the Problem of Moments - Lasserre (2001)   (Correct)
0.5:   Robust Solutions of Uncertain Quadratic and.. - Ben-Tal, Nemirovski, Roos (2001)   (Correct)

Similar documents based on text:   More   All
0.4:   Semidefinite Representations for Finite Varieties - Monique Laurent October (2002)   (Correct)
0.3:   Semidefinite Programming - Vandenberghe, Boyd (1994)   (Correct)
0.3:   Semidefinite Programming and Combinatorial Optimization - Goemans   (Correct)

BibTeX entry:   (Update)

@misc{ d'aspremont-semidefinite,
  author = "Alexandre d'Aspremont",
  title = "A Semidefinite Representation for some Minimum Cardinality Problems",
  url = "citeseer.ist.psu.edu/567919.html" }
Citations (may not include all citations):
326   Interior-point polynomial algorithms in convex programming (context) - Nesterov, Nemirovskii - 1994
276   Semidefinite programming - Vandenberghe, Boyd - 1996
51   Global optimization with polynomials and the problem of mome.. - Lasserre - 2001
39   Transactions of the American mathematical society (context) - Curto, Fialkow et al. - 2000
37   Squared functional systems and optimization problems (context) - Nesterov - 2000
35   Quadratic optimization problems (context) - Shor - 1987
30   Positive polynomials on compact semi-algebraic sets (context) - Putinar - 1993
14   Sums of squares of real polynomials (context) - Choi, Lam et al. - 1995
13   Extremal psd forms with few terms (context) - Reznick - 1978
9   Low-authority controller design via convex optimization - Hassibi, How et al. - 1999
9   Minimizing polynomial functions (context) - Parillo, Sturmfels - 2001
6   The multidimensional moment problem and semi-groups (context) - Berg - 1980
5   A rank minimization heuristic with application to minimum or.. (context) - Fazel, Hindi et al. - 2000
4   SIAM Journal on Optimization (context) - equivalent, program et al. - 2002
4   Computer algebra methods for equivariant dynamical systems - Gatermann - 2000
4   Solving moment problems by dimensional extension - Putinar, Vasilescu - 1999
4   Structured semidefinite programs and semialgebraic geometry .. (context) - Parillo - 2000
2   Lectures on modern convex optimization : analysis (context) - Ben-Tal, Nemirovski - 2001
2   moment problem for semi-algebraic sets (context) - Schmudgen, K- - 1991
1   Probleme de moments sur un compact de R et decomposition de .. (context) - Cassier - 1984
1   Report arXiv: math (context) - Gatermann, Parillo et al. - 2002
1   Seminaire de structures algebriques ordonnees: Equipe de log.. (context) - aspects, hilbert's et al. - 1996

Documents on the same site (http://www.stanford.edu/~aspremon/):   More
Calibration Et Gestion Des Risques Dans Les Modeles De Taux Par .. - d'Aspremont (2002)   (Correct)
Static Arbitrage Bounds on Basket Option Prices - d'Aspremont, Ghaoui (2002)   (Correct)
Interest Rate Model Calibration Using Semidefinite Programming - d'Aspremont (2003)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC