Interior Point and Semidefinite Approaches in Combinatorial Optimization
Authors:
- Kartik KrishnanKKKartik Krishnan
- Tamás TerlakyTTTamás Terlaky
- 11 August 2005
- book chapter
- Published by Springer Nature
- p. 101-157
Abstract
No abstract availableKeywords
This publication has 124 references indexed in Scilit:
- On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex2005
- Local Minima and Convergence in Low-Rank Semidefinite ProgrammingMathematical Programming, 2004
- On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-FunctionJournal of Combinatorial Optimization, 2004
- Bundle Methods to Minimize the Maximum Eigenvalue Function2000
- Squared Functional Systems and Optimization Problems2000
- Handbook of Semidefinite Programming2000
- Interior Point Methods for Combinatorial Optimization1998
- Interior Point Algorithms1997
- Implementation of Interior-Point Methods for Large Scale Linear Programs1996
- Interior Point Methods of Mathematical Programming1996