Finding the minimal root of an equation with the multiextremal and nondifferentiable left-hand part
From MaRDI portal
Publication:5959254
DOI10.1023/A:1014063303984zbMath1081.90601OpenAlexW1621958792MaRDI QIDQ5959254
Yaroslav D. Sergeyev, Anna Molinaro
Publication date: 26 March 2002
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014063303984
Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (6)
Finding roots of nonlinear equations using the method of concave support functions ⋮ Always convergent methods for nonlinear equations of several variables ⋮ Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework ⋮ Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms ⋮ Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization ⋮ Always convergent iteration methods for nonlinear equations of Lipschitz functions
Uses Software
This page was built for publication: Finding the minimal root of an equation with the multiextremal and nondifferentiable left-hand part
