Solving nonlinear equation systems via global partition and search: Some experimental results
From MaRDI portal
Publication:582008
DOI10.1007/BF02241652zbMath0689.65031OpenAlexW1565317970MaRDI QIDQ582008
Publication date: 1990
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02241652
numerical teststrigonometric systemsDanilin-Piyavskij-Shubert algorithmglobal optimization algorithmShekel-type systems
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)
Related Items (3)
Globally optimized calibration of environmental models ⋮ Convergence qualification of adaptive partition algorithms in global optimization ⋮ Stochastic modelling and optimization for environmental management
Cites Work
- Extended univariate algorithms for \(n\)-dimensional global optimization
- Global optimization on convex sets
- Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
- Constrained global optimization: algorithms and applications
- A method of solving non-linear equations, using a priori probability estimates of the roots
- Inclusion functions and global optimization
- Globally convergent methods for n-dimensional multiextremal optimization
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- Function minimization by conjugate gradients
- A Sequential Method Seeking the Global Maximum of a Function
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving nonlinear equation systems via global partition and search: Some experimental results
