In mathematical optimization, the cutting-plane method is an umbrella term for optimization methods which iteratively refine a feasible set orâ€¦Â (More)

(More)

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

2012

2012

- Karthekeyan Chandrasekaran, LÃ¡szlÃ³ A. VÃ©gh, Santosh Vempala
- 2012 IEEE 53rd Annual Symposium on Foundations ofâ€¦
- 2012

The cutting plane approach to optimal matchings has been discussed by several authors over the past decades, and its rate ofâ€¦Â (More)

Is this relevant?

2010

2010

- Egon Balas, Matteo Fischetti, Arrigo Zanette
- Math. Program.
- 2010

For thirty years after their invention half a century ago, cutting planes for integer programs have been an object of theoreticalâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Thorsten Joachims, Thomas Finley, Chun-Nam John Yu
- Machine Learning
- 2009

Discriminative training approaches like structural SVMs have shown much promise for building highly complex and accurate modelsâ€¦Â (More)

Is this relevant?

2007

2007

- Jie Sun, Kim-chuan Toh
- 2007

Semideenite feasibility problems arise in many areas of operations research. The abstract form of these problems can be describedâ€¦Â (More)

Is this relevant?

2007

2007

- Sharon Boyd
- 2007

4 Some specific cutting-plane methods 12 4.1 Bisection method on R . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13â€¦Â (More)

Is this relevant?

2002

2002

- Jie Sun, Kim-Chuan Toh, Gongyun Zhao
- Math. Oper. Res.
- 2002

Semidefinite feasibility problems arise in many areas of operations research. The abstract form of these problems can beâ€¦Â (More)

Is this relevant?

2001

2001

- Patrice Marcotte, Daoli Zhu
- Comp. Opt. and Appl.
- 2001

We present an iterative algorithm for solving variational inequalities under the weakest monotonicity condition proposed so farâ€¦Â (More)

Is this relevant?

1999

1999

We present a cutting plane algorithm for the feasibility problem that uses a homogenized self-dual approach to regain anâ€¦Â (More)

Is this relevant?

1998

1998

- Paul Tseng
- 1998

One of the major computational tasks of using the traditional cutting plane approach to solve linear semi-in nite programmingâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Pavel PudlÃ¡k
- J. Symb. Log.
- 1997

We prove an exponential lower bound on the length of cutting plane proofs. The proof uses an extension of a lower bound forâ€¦Â (More)

Is this relevant?