Subdivision strategies for boxes in branch-and-bound nonlinear solvers and verification
DOI10.1007/s11786-014-0207-8zbMath1302.65119OpenAlexW2083547413MaRDI QIDQ475422
Publication date: 27 November 2014
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-014-0207-8
verificationinterval analysissubdivisionnonlinear systems of equationssolversubdivision directionsubdivision point
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Numerical computation of solutions to systems of equations (65H10) Interval and finite arithmetic (65G30) General methods in interval analysis (65G40) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient task scheduling in the parallel result-verifying solution of nonlinear systems
- The cluster problem in multivariate global optimization
- Symbolic-Numeric Techniques for Solving Nonlinear Systems
- Interval arithmetic
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
This page was built for publication: Subdivision strategies for boxes in branch-and-bound nonlinear solvers and verification