## Topics in Semidefinite and Interior-Point Methods |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Testing the Feasibility of Semidefinite Programs | 17 |

Regularized | 39 |

Semidefinite Programming and Graph Equipartition | 77 |

The Totally Nonnegative Completion Problem | 97 |

How efficiently can we maximize threshold pseudoBoolean functions? | 127 |

Bayesian Heuristic Approach BHA and Applications to | 153 |

a Mine of Semidefinite Programming | 167 |

A LongStep Path Following Algorithm for Semidefinite | 181 |

Cutting Plane Algorithms for Semidefinite Relaxations | 197 |

InfeasibleStart Semidefinite Programming Algorithms via | 215 |

Solution of the Trust Region Problem via a Smooth Unconstrained | 237 |

### Other editions - View all

Topics in Semidefinite and Interior-point Methods Panos M. Pardalos,Henry Wolkowicz Limited preview - 1998 |

### Common terms and phrases

Alizadeh analysis Applications approach approximation bound central path chordal graphs clustering combinatorial optimization cone consider constraints convex programming corresponding cutting planes defined denote diagonal dual duality gap edge EDM(G eigenvalue embedding problem Euclidean distance matrix exists feasible solution given graph G Helmberg Hence heuristics induced subgraph inequalities infeasible integer interior point methods iteration Johnson knapsack knapsack problem Lemma Linear Algebra linear programming Math Mathematical Programming Mathematics Subject Classification max-cut Multi-SAT Nesterov nodes nonnegative matrix obtained operations optimal solution optimal value optimization problems parallel partition Poljak polyhedral polynomial polytope positive definite primal primal-dual Problem 1.2 problem instances programming problem proof Proposition PSD completion PSDK PSDM quadratic random Rendl resp SAT algorithms SAT problem satisfiability second order Section semidefinite programming semidefinite relaxations SIAM solving spectrahedron subgraph symmetric Technical report threshold functions topology totally nonnegative completion unconstrained variables vector Wolkowicz

### Popular passages

Page xi - F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization.

Page xii - U. Feige and MX Goemans. Approximating the value of two proper proof systems, with applications to MAX-2SAT and MAX-DICUT. In Proceeding of the Third Israel Symposium on Theory of Computing and Systems, pages 182-189, 1995.