Global optimization
From MaRDI portal
Publication:5896995
DOI10.1080/10556780903135287zbMath1180.90005OpenAlexW2911259274MaRDI QIDQ5896995
Publication date: 18 September 2009
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780903135287
Development of contemporary mathematics (01A65) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) History of operations research and mathematical programming (90-03)
Uses Software
Cites Work
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- BARON: A general purpose global optimization software package
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Convex underestimation strategies for signomial functions
- Ap-cone sequential relaxation procedure for 0-1 integer programs
- On the asymmetric eigenvalue complementarity problem
- Adaptive parameterized improving hit-and-run for global optimization
- Branching and bounds tighteningtechniques for non-convex MINLP
- Dynamic filters and randomized drivers for the multi-start global optimization algorithm MSNLP
- The global solver in the LINDO API
- PSwarm: a hybrid solver for linearly constrained global derivative-free optimization
- GlobSol user guide
- ICOS: a branch and bound based solver for rigorous global optimization
- G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
- INTLAB implementation of an interval global optimization algorithm
- GloptiPoly 3: moments, optimization and semidefinite programming
- 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
- Global optimization of binary Lennard–Jones clusters
- Enhanced bounding techniques to reduce the protein conformational search space
- An exact reformulation-linearisation technique algorithm for solving a parameter extraction problem arising in compact thermal models
- Cones of Matrices and Set-Functions and 0–1 Optimization
- An Algorithm for Separable Nonconvex Programming Problems
