by G. Iyengar, M. T. C Ezik
In Proceedings of the 1996 International Computer Music Conference. San Francisco, International Computer Music Association
http://firulete.ieor.columbia.edu/reports/techreports/tr-2001-02.ps.gz
Add To MetaCart
Abstract:
The goal of this research is to develop cut generation methods for mixed 0-1 second-order cone programs (SOCPs) having the following form,
Citations
|
195
|
Interior-point polynomial algorithms in convex programming
– Nesterov, Nemirovskii
- 1994
|
|
157
|
A lift-and-project cutting plane algorithm for mixed 0-1 programs
– Balas, Ceria, et al.
- 1993
|
|
155
|
Cones of matrices and set-functions and 0-1 optimization
– Lovász, Schrijver
- 1991
|
|
100
|
Determinant maximization with linear matrix inequality constraints
– VANDENBERGHE, BOYD, et al.
- 1998
|
|
67
|
Applications of second-order cone programming
– Lobo, Vandenberghe, et al.
- 1998
|
|
65
|
Disjunctive Programming
– Balas
- 1979
|
|
44
|
Cones of matrices and successive convex relaxations of nonconvex sets
– KOJIMA, TUNC, et al.
- 1999
|
|
22
|
A branch-and-cut method for 0-1 mixed convex programming
– Stubbs, Mehrotra
- 1999
|
|
8
|
Second order cone programming relaxation of nonconvex quadratic optimization problems
– Kim, Kojima
- 2001
|
|
2
|
C ezik. Semide methods for the traveling salesman and other combinatorial problems
– T
- 2000
|
|
2
|
Quadratically constrained quadratic programming: some applications and a method for solution
– Hao
- 1982
|
|
1
|
Computational study of a family of mixed integer quadratic programming problems
– Bienstock
- 1996
|
|
1
|
C ezik. Cutting plane methods for mixed 0-1 semide programs
– Iyengar, T
- 2000
|
|
1
|
A heirarchy of relaxations and convex hull representations for mixed zero-one programming problems
– Sherali, Adams
- 1989
|
|
1
|
A hierarchy of semide relaxations & convex nonlinear valid inequalities for mixed 0-1 convex programming
– Stubbs, Mehrotra
- 1997
|
|
1
|
Generating convex quadratic inequalities for mixed 0-1 programs
– Stubbs, Mehrotra
- 1999
|
