A comparison of complete global optimization solvers
From MaRDI portal
Publication:1780958
DOI10.1007/s10107-005-0585-4zbMath1099.90001OpenAlexW1985329511MaRDI QIDQ1780958
Tamás Vinkó, Waltraud Huyer, Arnold Neumaier, Oleg A. Shcherbina
Publication date: 14 June 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0585-4
Multi-objective and goal programming (90C29) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
EAGO.jl: easy advanced global optimization in Julia, Extended reverse-convex programming: an approximate enumeration approach to global optimization, Linear and parabolic relaxations for quadratic constraints, A review of recent advances in global optimization, Basin hopping networks of continuous global optimization problems, Best practices for comparing optimization algorithms, Derivative-free optimization: a review of algorithms and comparison of software implementations, On interval branch-and-bound for additively separable functions with common variables, Deterministic global optimization in ab-initio quantum chemistry, How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results, A review of computation of mathematically rigorous bounds on optima of linear programs, Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints, A computational study of global optimization solvers on two trust region subproblems, A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems, Large-Scale Loan Portfolio Selection, (Global) optimization: historical notes and recent developments, Influence modeling: mathematical programming representations of persuasion under either risk or uncertainty, Optimal Switching Sequence for Switched Linear Systems, Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings, Benchmarking nonlinear optimization software in technical computing environments, Some results on augmented Lagrangians in constrained global optimization via image space analysis, Solving kinematics problems by efficient interval partitioning, Global minimization using an augmented Lagrangian method with variable lower-level constraints, To be fair or efficient or a bit of both, Efficient interval partitioning-local search collaboration for constraint satisfaction, Nonlinear optimization with GAMS /LGO, A new class of test functions for global optimization, A reliable affine relaxation method for global optimization, Moving-horizon state estimation for nonlinear discrete-time systems: new stability results and approximation schemes, An approach to constrained global optimization based on exact penalty functions, Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems, Mathematically rigorous global optimization in floating-point arithmetic, A local relaxation approach for the siting of electrical substations, Constrained circles packing test problems: all the optimal solutions known, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming, Robust Optimization in Simulation: Taguchi and Krige Combined, Evaluating ASP and commercial solvers on the CSPLib, A derivative-free algorithm for constrained global optimization based on exact penalty functions, The optimization test environment
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- Rigorous global search: continuous problems
- Safe bounds in linear and mixed-integer linear programming
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Designing and reporting on computational experiments with heuristic methods
- A branch-and-reduce approach to global optimization
- Comparison of public-domain software for black box global optimization∗
- Complete search in continuous global optimization and constraint satisfaction
- Numerical Software with Result Verification
- Global Optimization and Constraint Satisfaction
- Benchmarking optimization software with performance profiles.
