Topics in Semidefinite and Interior-Point Methods

Front Cover
American Mathematical Soc., 1998 - 250 pages
0 Reviews
 

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
Copyright

Other editions - View all

Common terms and phrases

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.

References to this book

All Book Search results »

Bibliographic information