Global Optimization Submissions  2006
January 2006
A Note on Sparse SOS and SDP Relaxations for Polynomial Optimization Problems over Symmetric Cones
Masakazu Koima, Masakazu Muramatsu
February 2006
Theory
On the complexity of optimization over the standard simplex
Etienne De Klerk, Dick Den Hertog, Gamal Elabwabi
On the convergence of the MG/OPT method
Alfio Borzi
March 2006
Efficiently packing unequal disks in a circle: a computational approach which exploits the continuous and combinatorial structure of the problem
B. Addis, M. Locatelli, F. Schoen
Stochastic Approaches
Global optimization by continuous GRASP
Michael J. Hirsch, Claudio N. Meneses, Panos M. Pardalos, Mauricio G. C. Resende
A Particle Swarm Pattern Search Method for Bound Constrained Nonlinear Optimization
A. Ismael F. Vaz, Luís N. Vicente
April 2006
Theory
Convergent SDPrelaxations in polynomial optimization with sparsity
Jean B. Lasserre
Other
An improved algorithm for computing Steiner minimal trees in Euclidean dspace
M. Fampa, K.M. Anstreicher
Optimization of univariate functions on bounded intervals by interpolation and semidefinite programming
Etienne De Klerk, Gamal Elabwabi, Dick Den Hertog
August 2006
Nonlinear Optimization with GAMS /LGO
Janos D. Pinter
September 2006
Theory
Exploiting symmetries in SDPrelaxations for polynomial optimization
L Jansson, J.B. Lasserre, C. Riener, T. Theobald
Solving molecular distance geometry problems by global optimization algorithms
Andrea Grosso, Marco Locatelli, Fabio Schoen
Speeding up continuous GRASP
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. C. Resende
The complexity of optimizing over a simplex, hypercube or sphere: a short survey
Etienne De Klerk
November 2006
Solving systems of nonlinear equations with continuous GRASP
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. C. Resende
December 2006
Global minimization using an Augmented Lagrangian method with variable lowerlevel constraints
Ernesto G. Birgin, Christodoulos A. Floudas, José Mario Martínez
