Optimal solution of nonlinear equations satisfying a Lipschitz condition

DOI10.1007/BF01390124zbMath0514.65033MaRDI QIDQ1051396

J. Blot

Publication date: 1984

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132898

zbMATH Keywords

complexitysearch algorithmoptimal solutionoptimal algorithmLipschitz conditioninformation operator

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items (3)

For which error criteria can we solve nonlinear equations? ⋮ Optimal solution of nonlinear equations ⋮ Exponential lower bounds for finding Brouwer fixed points

Cites Work

• Unnamed Item
• Bisection is optimal
• Optimum Sequential Search and Approximation Methods Under Minimum Regularity Assumptions
• On the Systematic Search in a Hypercube
• Optimal sequential and non-sequential procedures for evaluating a functional
• Optimal search for the roots of a function satisfying a lipschitz condition
• Systematic Search in High Dimensional Sets
• Optimal strategies for seeking the global maximum of a function
• On the optimality of linear methods for operator approximation in convex classes of functions
• Optimal strategies of the search for an extremum

This page was built for publication: Optimal solution of nonlinear equations satisfying a Lipschitz condition