What people are saying - Write a review
We haven't found any reviews in the usual places.
Testing the Feasibility of Semidefinite Programs
Semidefinite Programming and Graph Equipartition
The Totally Nonnegative Completion Problem
How efficiently can we maximize threshold pseudoBoolean functions?
Bayesian Heuristic Approach BHA and Applications to
a Mine of Semidefinite Programming
A LongStep Path Following Algorithm for Semidefinite
Cutting Plane Algorithms for Semidefinite Relaxations
InfeasibleStart Semidefinite Programming Algorithms via
Solution of the Trust Region Problem via a Smooth Unconstrained
Other editions - View all
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
Page xi - F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization.