Global optimization

DOI10.1080/10556780903135287MaRDI QIDQ5896995zbMATH OpenOpenAlexFDO

Authors Nikolaos V. Sahinidis

Publication date 18 September 2009

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556780903135287

Mathematics Subject Classification ID

Development of contemporary mathematics (01A65) History of operations research and mathematical programming (90-03) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Cites work

• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• Ap-cone sequential relaxation procedure for 0-1 integer programs
• Adaptive parameterized improving hit-and-run for global optimization
• An Algorithm for Separable Nonconvex Programming Problems
• An exact reformulation-linearisation technique algorithm for solving a parameter extraction problem arising in compact thermal models
• BARON: A general purpose global optimization software package
• Branching and bounds tighteningtechniques for non-convex MINLP
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Convex underestimation strategies for signomial functions
• Dynamic filters and randomized drivers for the multi-start global optimization algorithm MSNLP
• Enhanced bounding techniques to reduce the protein conformational search space
• G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
• Global optimization of binary Lennard–Jones clusters
• GlobSol user guide
• GloptiPoly 3: moments, optimization and semidefinite programming
• ICOS: a branch and bound based solver for rigorous global optimization
• INTLAB implementation of an interval global optimization algorithm
• Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
• On the asymmetric eigenvalue complementarity problem
• Piecewise polynomial interpolations and approximations of one-dimensional functions through mixed integer linear programming
• Provably near-optimal solutions for very large single-row facility layout problems
• PSwarm: a hybrid solver for linearly constrained global derivative-free optimization
• The global solver in the LINDO API

Describes a project that uses

Uses Software

• BARON
• GLOPTLAB
• PSwarm
• ICOS
• GloptiPoly
• LINDO
• GlobSol

This page was built for publication: Global optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896995)