Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions
From MaRDI portal
Publication:4785926
DOI10.1137/S1064827599357590zbMath1014.65054MaRDI QIDQ4785926
Leocadio G. Casado, Yaroslav D. Sergeyev, Inmaculada F. García
Publication date: 5 January 2003
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
algorithms; global optimization; numerical experiments; interval analysis; branch-and-bound; nondifferentiable functions; minimal root
65K05: Numerical mathematical programming methods
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C30: Nonlinear programming
65G30: Interval and finite arithmetic
Related Items
A Mazur–Orlicz Type Theorem in Interval Analysis and Its Consequences, Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. I: Algorithmic details, Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. II: Applications to ellipses and ellipsoids, Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants, Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization, A review of recent advances in global optimization, Univariate global optimization with multiextremal non-differentiable constraints without penalty functions, On first zero crossing points.
Uses Software