[图书][B] Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
PA Parrilo - 2000 - search.proquest.com
In the first part of this thesis, we introduce a specific class of Linear Matrix Inequalities (LMI)
whose optimal solution can be characterized exactly. This family corresponds to the case …
whose optimal solution can be characterized exactly. This family corresponds to the case …
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
S Burer, RDC Monteiro - Mathematical programming, 2003 - Springer
In this paper, we present a nonlinear programming algorithm for solving semidefinite
programs (SDPs) in standard form. The algorithm's distinguishing feature is a change of …
programs (SDPs) in standard form. The algorithm's distinguishing feature is a change of …
[图书][B] Optimization by GRASP
MGC Resende, CC Ribeiro - 2016 - Springer
Greedy randomized adaptive search procedures, or GRASP, were introduced by T. Feo and
M. Resende in 1989 as a probabilistic heuristic for solving hard set covering problems. Soon …
M. Resende in 1989 as a probabilistic heuristic for solving hard set covering problems. Soon …
[图书][B] Aspects of semidefinite programming: interior point algorithms and selected applications
E De Klerk - 2006 - books.google.com
Semidefinite programming has been described as linear programming for the year 2000. It is
an exciting new branch of mathematical programming, due to important applications in …
an exciting new branch of mathematical programming, due to important applications in …
[图书][B] Inverse eigenvalue problems: theory, algorithms, and applications
M Chu, G Golub - 2005 - books.google.com
Inverse eigenvalue problems arise in a remarkable variety of applications and associated
with any inverse eigenvalue problem are two fundamental questions—the theoretical issue …
with any inverse eigenvalue problem are two fundamental questions—the theoretical issue …
Rank-two relaxation heuristics for max-cut and other binary quadratic programs
The Goemans--Williamson randomized algorithm guarantees a high-quality approximation
to the MAX-CUT problem, but the cost associated with such an approximation can be …
to the MAX-CUT problem, but the cost associated with such an approximation can be …
Semidefinite programming for combinatorial optimization
C Helmberg - 2000 - opus4.kobv.de
This book offers a self-contained introduction to the field of semidefinite programming, its
applications in combinatorial optimization, and its computational methods. We equip the …
applications in combinatorial optimization, and its computational methods. We equip the …
Randomized heuristics for the MAX-CUT problem
Given an undirected graph with edge weights, the MAX-CUT problem consists in finding a
partition of the nodes into two subsets, such that the sum of the weights of the edges having …
partition of the nodes into two subsets, such that the sum of the weights of the edges having …
Breakout local search for the max-cutproblem
Given an undirected graph G=(V, E) where each edge of E is weighted with an integer
number, the maximum cut problem (Max-Cut) is to partition the vertices of V into two disjoint …
number, the maximum cut problem (Max-Cut) is to partition the vertices of V into two disjoint …