A collection of test problems for constrained global optimization algorithms
Numerical mathematical programming methods (65K05) Parallel algorithms in computer science (68W10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Quadratic programming (90C20) Nonlinear programming (90C30)
This book is the first systematic collection of test problems for global optimization. The problems can be used to test for correctness, and compare global optimization algorithms. As such, it is an important handbook for specialist in the area, first of all algorithm designers and developers. Several aspects of an algorithm can be tested, like effectiveness with respect to different problem classes, speed, capacity, accuracy. In the book, the main emphasis is on real-life problems, though some randomly generated problems are also presented. Two chapters provide standard and randomly generated test problems for quadratic programming and quadratically constrained problems. Starting from Chapter 4, test problems are presented that arise in a variety of applications like destillation column sequencing, blending/pooling, heat exchanger networks, phase and chemical reaction equilibrium, complex reactor networks, reactor-separator-recycle systems, and VLSI design. In addition to a very brief problem description, problem statements, optimal solutions or best known solutions are also given.
- A dynamic programming extension to the steady state refinery-LP
- Towards ``Ideal multistart. A stochastic approach for locating the minima of a continuous function inside a bounded domain
- More test examples for nonlinear programming codes
- Reduction of indefinite quadratic programs to bilinear programs
- Generating quadratic assignment test problems with known optimal permutations
- Evolution program for deterministic and stochastic optimizations
- On proving existence of feasible points in equality constrained optimization problems
- Handbook of test problems in local and global optimization
- Parallel computing in nonconvex programming
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- A new technique for generating quadratic programming test problems
- Primal-relaxed dual global optimization approach
- On global optimization in two-dimensional scaling
- Global minimization by reducing the duality gap
- Application of Bayesian approach to numerical methods of global and stochastic optimization
- A generalization of the construction of test problems for nonconvex optimization
- A class of test functions for global optimization
- On the construction of test problems for concave minimization algorithms
- Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
- Lower bound functions for polynomials
- Performance of several nonlinear programming software packages on microcomputers.
- Interval mathematics, algebraic equations and optimization
- Accelerated random search for constrained global optimization assisted by radial basis function surrogates
- Best practices for comparing optimization algorithms
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- Global minimization of nonsmooth constrained global optimization with filled function
- Combining interval branch and bound and stochastic search
- MINQ8: general definite and bound constrained indefinite quadratic programming
- Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation
- Some global optimization problems on Stiefel manifolds
- A comparison of complete global optimization solvers
- Test problem construction for linear bilevel programming problems
- Rigorous convex underestimators for general twice-differentiable problems
- Linearly constrained global optimization: a general solution algorithm with applications.
- A global optimization algorithm for linear fractional and bilinear programs
- Constructing large feasible suboptimal intervals for constrained nonlinear optimization
- Computational experience with penalty-barrier methods for nonlinear programming
- Designing and reporting on computational experiments with heuristic methods
- A branch-and-reduce approach to global optimization
- Convergence analysis of a proximal Gauss-Newton method
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems
- A global optimization point of view to handle non-standard object packing problems
- Global minimization of non-smooth unconstrained problems with filled function
- Improving the performance of weighted Lagrange-multiplier methods for nonlinear constrained optimization
- Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction
- A sublevel moment-SOS hierarchy for polynomial optimization
- Sequence of polyhedral relaxations for nonlinear univariate functions
- DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems
- Dynamic search trajectory methods for global optimization
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- A wide class of test functions for global optimization
- A penalty function-based differential evolution algorithm for constrained global optimization
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- A bounded degree SOS hierarchy for polynomial optimization
- Global optimization by continuous grasp
- Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
- Memetic particle swarm optimization
- A cellular framework for structural analysis and optimization
- Computational experience using an edge search algorithm for linear reverse convex programs
- Global optimality conditions for nonconvex minimization problems with quadratic constraints
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- Stochastic filter methods for generally constrained global optimization
- scientific article; zbMATH DE number 4129902 (Why is no real title available?)
- Test problem generator for unconstrained global optimization
- Biogeography-based optimization for constrained optimization problems
- Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization
- An unconstrained optimization test functions collection
- A double-multiplicative dynamic penalty approach for constrained evolutionary optimization
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- scientific article; zbMATH DE number 553775 (Why is no real title available?)
- Minimizing the sum of a convex function and the product of two affine functions over a convex set
- On linear programs with linear complementarity constraints
- A new auxiliary function method for general constrained global optimization
- A new hybrid algorithm of scatter search and Nelder-Mead algorithms to optimize joint economic lot sizing problem
- Global optimality conditions and optimization methods for polynomial programming problems
- A collection of test multiextremal optimal control problems
- Piecewise convex maximization problems: Piece adding technique
- Benchmarking global optimization and constraint satisfaction codes
- Quasiconvex relaxations based on interval arithmetic
- On the chromatic number of graphs
- Inscribed ball and enclosing box methods for the convex maximization problem
- On the utility of randomly generated functions for performance evaluation of evolutionary algorithms
- Piece adding technique for convex maximization problems
- Partitioning procedure for polynomial optimization
- scientific article; zbMATH DE number 7705675 (Why is no real title available?)
- Employing the cloud for finding solutions to large systems of nonlinear equations
- Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions
- Study of multiscale global optimization based on parameter space partition
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
- A projected-gradient interior-point algorithm for complementarity problems
- T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
- CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method
- A novel reinforcement learning-inspired tunicate swarm algorithm for solving global optimization and engineering design problems
- Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
- A new filled function method for solving constrained global optimization problems
- Extending OSCARS-II to generally constrained global optimization
- A solution method for mixed-variable constrained blackbox optimization problems
- Extended duality for nonlinear programming
This page was built for publication: A collection of test problems for constrained global optimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1188890)