Benchmarking global optimization and constraint satisfaction codes
From MaRDI portal
Publication:5897050
DOI10.1007/B94062zbMATH Open1296.90004OpenAlexW2624301280MaRDI QIDQ5897050FDOQ5897050
Authors: Arnold Neumaier, Djamila Sam-Haroud, Xuan-Ha Vu, Tuan-Viet Nguyen, Oleg A. Shcherbina 
Publication date: 2 February 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94062
Recommendations
- A comparison of complete global optimization solvers
- A collection of test problems for constrained global optimization algorithms
- Comparative assessment of algorithms and software for global optimization
- A literature survey of benchmark functions for global optimisation problems
- Benchmarking optimization software with performance profiles.
Nonconvex programming, global optimization (90C26) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cited In (40)
- Convergent upper bounds in global minimization with nonlinear equality constraints
- Exclusion regions for optimization problems
- The optimization test environment
- Solving kinematics problems by efficient interval partitioning
- Constrained circles packing test problems: all the optimal solutions known
- Benchmarking optimization software -- a (Hi)story
- A DIRECT-type approach for derivative-free constrained global optimization
- Benchmarking nonlinear optimization software in technical computing environments
- A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
- Global optimization and constraint satisfaction. First international workshop on global constraint optimization and constraint satisfaction, COCOS 2002, Valbonne-Sophia Antipolis, France, October 2--4, 2002. Revised selected papers
- A derivative-free algorithm for constrained global optimization based on exact penalty functions
- A review of recent advances in global optimization
- Efficient interval partitioning-local search collaboration for constraint satisfaction
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- On tightness and anchoring of McCormick and other relaxations
- Optimality Measures for Performance Profiles
- Filter-based DIRECT method for constrained global optimization
- Node selection strategies in interval branch and bound algorithms
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
- Evaluating ASP and commercial solvers on the CSPLib
- Linear and parabolic relaxations for quadratic constraints
- Best practices for comparing optimization algorithms
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- A reliable affine relaxation method for global optimization
- Constraint aggregation for rigorous global optimization
- A linear constrained optimization Benchmark for probabilistic search algorithms: the rotated Klee-Minty problem
- Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space
- Efficient interval partitioning for constrained global optimization
- A comparison of complete global optimization solvers
- Efficient computation of spectral bounds for Hessian matrices on hyperrectangles for global optimization
- A general framework for convexity analysis in deterministic global optimization
- Improved constraint consensus methods for seeking feasibility in nonlinear programs
- First order rejection tests for multiple-objective optimization
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
- Rigorous verification of feasibility
- Reverse propagation of McCormick relaxations
- On method overfitting
- On rigorous upper bounds to a global optimum
- Improved Automatic Computation of Hessian Matrix Spectral Bounds
- Global optimization test problems based on random field composition
Uses Software
This page was built for publication: Benchmarking global optimization and constraint satisfaction codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897050)
