Semidefinite programming (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function (an objectiveâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2005

Highly Cited

2005

- Anthony Man-Cho So, Yinyu Ye
- SODA
- 2005

We analyze the semidefinite programming (SDP) based model and method for the position estimation problem in sensor networkâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Kilian Q. Weinberger, Lawrence K. Saul
- International Journal of Computer Vision
- 2004

Can we detect low dimensional structure in high dimensional data sets of images? In this paper, we propose an algorithm forâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Pablo A. Parrilo
- Math. Program.
- 2003

A hierarchy of convex relaxations for semialgebraic problems is introduced. For questions reducible to a finite number ofâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Christoph Helmberg, Franz Rendl
- SIAM Journal on Optimization
- 2000

A central drawback of primal-dual interior point methods for semidefinite programs is their lack of ability to exploit problemâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Pablo A. Parrilo
- 2000

In the first part of this thesis, we introduce a specific class of Linear Matrix Inequalities (LMI) whose optimal solution can beâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Michel X. Goemans
- Math. Program.
- 1997

We discuss the use of semidefinite programming for combinatorial optimization problems. The main topics covered include (i) theâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Aharon Ben-Tal, Arkadi Nemirovski
- SIAM Journal on Optimization
- 1997

We present and motivate a new model of the truss topology design problem, where the rigidity of the resulting truss with respectâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Christoph Helmberg, Franz Rendl, Robert J. Vanderbei, Henry Wolkowicz
- SIAM Journal on Optimization
- 1996

We propose a new interior point based method to minimize a linear function of a matrix variable subject to linear equality andâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Michel X. Goemans, David P. Williamson
- J. ACM
- 1995

We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problemsâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- David R. Karger, Rajeev Motwani, Madhu Sudan
- FOCS
- 1994

We consider the problem of coloring <italic>k</italic>-colorable graphs with the fewest possible colors. We present a randomizedâ€¦Â (More)

Is this relevant?