<--- Back to Details
First PageDocument Content
Operations research / Discrete geometry / NP-complete problems / Conjectures / Circle packing / Sphere packing / Independent set / Kepler conjecture / Tammes problem / Mathematical optimization / Semidefinite programming / FranklRdl graph
Operations research
Discrete geometry
NP-complete problems
Conjectures
Circle packing
Sphere packing
Independent set
Kepler conjecture
Tammes problem
Mathematical optimization
Semidefinite programming
FranklRdl graph

Moment methods in energy minimization David de Laat CWI Amsterdam Andrejewski-Tage Moment problems in theoretical physics

Add to Reading List

Source URL: www.daviddelaat.nl

Download Document from Source Website

File Size: 1,44 MB

Share Document on Facebook

Similar Documents

Preprints of the 16th IFAC Symposium on System Identification The International Federation of Automatic Control Brussels, Belgium. July 11-13, 2012 Identification of a Wiener System via Semidefinite Programming

Preprints of the 16th IFAC Symposium on System Identification The International Federation of Automatic Control Brussels, Belgium. July 11-13, 2012 Identification of a Wiener System via Semidefinite Programming

DocID: 1vrYF - View Document

Semidefinite Programming Duality Implications for System Theory and Computation Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University  6 July, 2004

Semidefinite Programming Duality Implications for System Theory and Computation Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 6 July, 2004

DocID: 1vqgc - View Document

ON THE LASSERRE HIERARCHY OF SEMIDEFINITE PROGRAMMING RELAXATIONS OF CONVEX POLYNOMIAL OPTIMIZATION PROBLEMS ETIENNE DE KLERK∗ AND MONIQUE LAURENT† Abstract. The Lasserre hierarchy of semidefinite programming approxi

ON THE LASSERRE HIERARCHY OF SEMIDEFINITE PROGRAMMING RELAXATIONS OF CONVEX POLYNOMIAL OPTIMIZATION PROBLEMS ETIENNE DE KLERK∗ AND MONIQUE LAURENT† Abstract. The Lasserre hierarchy of semidefinite programming approxi

DocID: 1vq1m - View Document

A Newton-CG Augmented Lagrangian Method for Semidefinite Programming∗ Xin-Yuan Zhao †

A Newton-CG Augmented Lagrangian Method for Semidefinite Programming∗ Xin-Yuan Zhao †

DocID: 1vnwF - View Document

COMPARISON BETWEEN AN INFEASIBLE INTERIOR POINT ALGORITHM AND A HOMOGENEOUS SELF DUAL ALGORITHM FOR SEMIDEFINITE PROGRAMMING  by

COMPARISON BETWEEN AN INFEASIBLE INTERIOR POINT ALGORITHM AND A HOMOGENEOUS SELF DUAL ALGORITHM FOR SEMIDEFINITE PROGRAMMING by

DocID: 1uVxH - View Document