Subdivision strategies for boxes in branch-and-bound nonlinear solvers and verification
DOI10.1007/S11786-014-0207-8zbMATH Open1302.65119OpenAlexW2083547413MaRDI QIDQ475422FDOQ475422
Authors: Elke Just
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
Recommendations
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) General methods in interval analysis (65G40) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Interval and finite arithmetic (65G30)
Cites Work
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
- Title not available (Why is that?)
- Title not available (Why is that?)
- The cluster problem in multivariate global optimization
- Interval arithmetic: from principles to implementation
- Efficient task scheduling in the parallel result-verifying solution of nonlinear systems
- Symbolic-Numeric Techniques for Solving Nonlinear Systems
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication: Subdivision strategies for boxes in branch-and-bound nonlinear solvers and verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475422)