Bound constrained interval global optimization in the COCONUT environment
From MaRDI portal
Publication:475813
DOI10.1007/s10898-013-0139-xzbMath1302.90152OpenAlexW2044121568MaRDI QIDQ475813
Mihály Csaba Markót, Hermann Schichl
Publication date: 27 November 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0139-x
Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
Algorithmic differentiation techniques for global optimization in the COCONUT environment ⋮ Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ (Global) optimization: historical notes and recent developments ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Robust Designs for Circle Coverings of a Square ⋮ Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interval analysis on directed acyclic graphs for global optimization
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- Optimal centered forms
- The cluster problem in multivariate global optimization
- Use of interval slopes for the irrational part of factorable functions
- \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}
- Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
- A polyhedral branch-and-cut approach to global optimization
- Exclusion regions for optimization problems
- New interval methods for constrained global optimization
- Algorithmic differentiation techniques for global optimization in the COCONUT environment
- Comparison and Automated Selection of Local Optimization Solvers for Interval Global Optimization Methods
- Introduction to Interval Analysis
- Centered Forms
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Exclusion Regions for Systems of Equations
- A Limited Memory Algorithm for Bound Constrained Optimization
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
