Global Optimization
``Consider
everything.
Keep the
good.
Avoid evil
whenever you notice it.''
(1 Thess. 5:21-22)
New -
COCONUT -
GloptLab
Introduction -
Techniques
Software (global) -
Software (local) -
Test Problems
Applications -
Other Optimization -
Related Topics
People -
Open Positions in Global Optimization
Bulgarian translation -- Belorussian translation -- French translation
This is a comprehensive archive of online information on (almost exclusively non-commercial) global optimization, and somewhat less comprehensive on local optimization, collected by Arnold Neumaier on the web server http://www.mat.univie.ac.at/~neum/glopt.html of the Computational Mathematics group at the University of Vienna, Austria. Later on this page there is a Table of Contents of this Site.
Please help to keep the archive up to date by informing me at Arnold.Neumaier@univie.ac.at about new or missing electronic documents related to public domain work on global optimization, and about links that are no longer working.
Related, but not formally part of this site are two other sites maintained by our research group in Vienna:
Past Positions in Global Optimization
LINCOA, LINearly Constrained Optimization Algorithm
for up to a few hundred variables
(in Fortran 77, by Mike Powell)
Comparison of derivative-free optimization algorithms (2012, by Nick Sahinidis)
Black-Box Optimization Benchmarking (BBOB) 2012 (by Auger, Hansen, et al.)
Projective methods for constraint satisfaction and global optimization (slides of a lecture at ISMP2012)
Structure-driven methods for large-scale optimization
VXQR1, Derivative-free unconstrained optimization based on QR factorizations (by Arnold Neumaier)
IGPE - Incremental Global Parameter Estimation, for the global estimation of parameters in dynamical systems.
GloptLab, an easy-to-use testing and development platform for solving quadratic constraint satisfaction problems, written in Matlab. All implemented methods are rigorous, hence it is guaranteed that no feasible point is lost.
BMIBNB, Global solver for nonconvex problems in the YALMIP modeling environment (in Matlab, by Johan Löfberg)
Black Box Optimization with Data Analysis for the global optimization of smooth problems with expensive objective and/or constraints (by Kevin Kofler)
Global optimization and constraint satisfaction (slides of my GICOLAG talk)
The 2006 Beale-Orchard-Hays Prize for Excellence in Computational Mathematical Programming went to Nick Sahinidis and Mohit Tawarmalani for their paper describing the global optimization package BARON
LaGO, Branch and Cut algorithm for nonconvex mixed integer nonlinear programs
GICOLAG, Global Optimization - Integrating Convexity, Optimization, Logic Programming, and Computational Algebraic Geometry, A visiting and research program by the International Erwin Schrödinger Institute for Mathematical Physics (ESI) Vienna, Austria, October 1 - December 23, 2006
The NEOS Server offers BARON for the solution of global optimization problems in GAMS format (excellent package!)
Constrained global optimization (pdf, 225K), slides of a lecture (by Arnold Neumaier)
RSOLVER (by Stefan Ratschan)
for solving quantified inequality constraints. Examples include:
projecting the solution set of a set of inequality constraints to two
dimensions.
Books and papers on global optimization (Google scholar search)
Online Papers in Global Optimization (a random collection of about 300 papers)
ICOS, rigorous complete solver for continuous constraint satisfaction problems
Comparison of Global Solvers
Within the COCONUT project, we performed extensive tests of the global
solvers BARON, GlobSol, ICOS, LGO, LINGO, OQNLP, Premium Solver,
MINOS, and COCOS (the solver in the alpha test version of the
COCONUT environment) for various sublibraries of the COCONUT benchmark.
SNOBFIT, MATLAB 6 package for the robust and fast solution of optimization problems with continuous variables varying within bound, possibly subject to additional soft constraints
W. Huyer,
A comparison of some algorithms for bound constrained global
optimization, Manuscript (2004).
(pdf file, 69K)
The paper contains comparisons of the three heuristic global
optimization programs MCS, Global, PGSL, using black box function
evaluation only.
The COCONUT environment is publicly available in an alpha test version since March 20, 2004.
Since starting this optimization page (September 1, 1995), this page was accessed steadily by about 30-40 different computers per day (last counted in 1999).
Updates to the contents are made quite frequently. I try to keep a complete coverage of public domain work on continuous global optimization; many references to combinatorial and local optimization are included for my (and your) convenience, but there I don't aim at completeness. Thanks to all who helped me by providing useful information.
The archive was reorganized on November 12, 1996; it now contains more than 1000 links to sources outside our server.
Please write me to Arnold.Neumaier@univie.ac.at if your own work is not referenced, if you know some other useful link to public domain work that is missing here, or if you find any invalid links.
If you do lots of computer work, prevent Computer Related Repetitive Strain Injuries by improving your typing habits.
In the following table of contents, italic headings correspond to different files, while roman headings correspond to sections within a file. There are further files not in this table of contents, accessible through links given in individual files.
Introduction to Global Optimization
Optimization Conferences
Some Optimization Journals
Some Optimization Sites
Interval Methods
Regularization
Protein Folding
Artificial Intelligence
my home page
(http://www.mat.univie.ac.at/~neum)
Arnold Neumaier (Arnold.Neumaier@univie.ac.at)