Cone-LP's and semidefinite programs: Geometry and a simplex-type method

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1084, Issue , 1996, Pages 162-174

  Pataki, Gábor ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; LINEAR PROGRAMMING;

BASIC SOLUTIONS; FEASIBLE DIRECTIONS; LINEAR PROGRAMS; NON-DEGENERACY; OPTIMIZATION PROBLEMS; SEMIDEFINITE PROGRAMS; SIMPLEX METHODS; TWO DIRECTIONS;

INTEGER PROGRAMMING;

EID: 21344441658     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_13     Document Type: Conference Paper

References (23)

1. F. Aiizadeh, J.-P, Haeberly and M. Overton: Complementarity and Nondegeneracy in Semidefinite Programming, manuscript, 1995
2. F. Aiizadeh: Combinatorial Optimization with Semi-Definite Matrices SIAM Journal of Optimization, 5 (1), 1995
3. E. Anderson andf P. Nash: Linear Programming in Infinite Dimensional Spaces, John Wiley and Sons, 1987
4. G. P. Barker and D, Carlson: Cones of Diagonally Dominant Matrices, Pacific Journal of Mathematics, 57:1, 15-32, 1975
5. A. Brondsted: An Introduction to Convex Polytopes, Springer-Verlag, 1983
6. J. Cullum, W.E. Donath and P. Wolfe: The minimization of certain nondiffer-entiable sums of eigenvalue problems, Mathematical Programming Study, 3:35-55, 1975
7. R. J. Duffin: Infinite Programs, in A. W. Tucker, editor, Linear Equalities and Related Systems, 157-170, Princeton University Press, Princeton, NJ, 1956
8. A. Vieze and M. Jerrum: Approximation algorithms for the fe-cut, and graph bisection problems using semidefmite programming, 4'th Conference on Integer Programming and Combinatorial Optimization, Copenhagen, 1995
9. M. Grötsckel, L. Lovász and A. Schrijver: Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, 1988
10. M.X.Goemans and D. Williamson: Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming, to appear in Journal of ACM
11. C. Helmberg, F. Rendl, R. Vanderbei and H. Wolkowicz: An Interior-Point Method for Semi-Definite Programming, to appear in SIAM Journal of Optimization
12. D. Karger, R. Motwani and M. Sudan: Approximate graph coloring by semidefinite programming, Technical report, Stanford University
13. M. Laurent and S. Poljak: On a Positive Semidefinite Relaxation of the Cut Polytope, Technical Report, LIENS 93-27
14. Yu. Nesterov and A. Nemirovskii: Interior Point Algorithms in Convex Programming, SIAM, Philadelphia, 1994
15. M. L. Overton: Large-scale Optimization of Eigenvalues, SIAM J. Optimization, 2(1):88-120
16. G. Pataki: On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues, Management Science Research Report MSRR-#604, GSIA, Carnegie Mellon University
17. Rockafellar, R. T.: Convex Analysis, Princeton University Press, Princeton, N.J., 1970
18. F. Rendl and H. Wolkowicz: A Semidefinite Framework for Trust Region Subproblems with Applications to Large Scale Minimization, Technical Report CORR 94-32, University of Waterloo, 1994
19. M. Ramana, L. Tunçel and H. Wolkowicz: Strong duality in semidefinite programming, Technical Report CORR 95-12, University of Waterloo, to appear in SIAM Journal of Optimization
20. A. Shapiro and M.K.H. Fan: On eigenvalue optimization, SIAM Journal of Optimization 3(1995), 552-568
21. A. Shapiro: First and second order analysis of nonlinear semidefinite programs, Math. Programming, Ser. B to appear
22. L. Vandenberghe and S. Boyd: Positive definite programming, Technical Report, Electrical Engineering Department, Stanford University, 1994
23. H. Wolkowicz: Some applications of optimization in matrix theory, Linear Algebra and its Applications, 40:101-118, 1981