Symbolic-interval heuristic for bound-constrained minimization
From MaRDI portal
Publication:5897044
DOI10.1007/B94062zbMATH Open1255.90101OpenAlexW2624301280MaRDI QIDQ5897044FDOQ5897044
Authors: Evgueni S. Petrov 
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
- scientific article; zbMATH DE number 3854326
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
- Interval tools for global optimization
- Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods
- On rigorous upper bounds to a global optimum
Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)
This page was built for publication: Symbolic-interval heuristic for bound-constrained minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897044)
