Benchmarking global optimization and constraint satisfaction codes
From MaRDI portal
Publication:5897050
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.
Cited in
(40)- Improved constraint consensus methods for seeking feasibility in nonlinear programs
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
- On method overfitting
- A reliable affine relaxation method for global optimization
- Convergent upper bounds in global minimization with nonlinear equality constraints
- Rigorous verification of feasibility
- On rigorous upper bounds to a global optimum
- Reverse propagation of McCormick relaxations
- Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space
- On tightness and anchoring of McCormick and other relaxations
- A comparison of complete global optimization solvers
- A review of recent advances in global optimization
- Exclusion regions for optimization problems
- Constrained circles packing test problems: all the optimal solutions known
- Evaluating ASP and commercial solvers on the CSPLib
- Efficient interval partitioning for constrained global optimization
- Constraint aggregation for rigorous global optimization
- Node selection strategies in interval branch and bound algorithms
- A DIRECT-type approach for derivative-free constrained global optimization
- A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
- Efficient interval partitioning-local search collaboration for constraint satisfaction
- Optimality Measures for Performance Profiles
- First order rejection tests for multiple-objective optimization
- A general framework for convexity analysis in deterministic global optimization
- Benchmarking optimization software -- a (Hi)story
- The optimization test environment
- Linear and parabolic relaxations for quadratic constraints
- Filter-based DIRECT method for constrained global optimization
- 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
- Improved Automatic Computation of Hessian Matrix Spectral Bounds
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- Global optimization test problems based on random field composition
- Efficient computation of spectral bounds for Hessian matrices on hyperrectangles for global optimization
- Solving kinematics problems by efficient interval partitioning
- Best practices for comparing optimization algorithms
- Benchmarking nonlinear optimization software in technical computing environments
- A linear constrained optimization Benchmark for probabilistic search algorithms: the rotated Klee-Minty problem
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)
