Average-Case Optimality of a Hybrid Secant-Bisection Method
From MaRDI portal
Recommendations
- Asymptotic near optimality of the bisection method
- scientific article; zbMATH DE number 903755
- Optimal Secant-Type Methods for Operator Equations
- An Enhancement of the Bisection Method Average Performance Preserving Minmax Optimality
- Secant methods for semismooth equations
- scientific article; zbMATH DE number 1086544
- On Hybrid Semi-Iterative Methods
- Inexact Secant Methods for Nonlinear Constrained Optimization
- Approximation of satisfactory bisection problems
- A unified convergence analysis for secant-type methods
Cites work
- Average errors for zero finding: Lower bounds for smooth or monotone functions
- Designs for Regression Problems with Correlated Errors III
- scientific article; zbMATH DE number 48872 (Why is no real title available?)
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- scientific article; zbMATH DE number 3052543 (Why is no real title available?)
- Information of varying cardinality
- On Enclosing Simple Roots of Nonlinear Equations
- Optimal solution of nonlinear equations
- Some complexity results for zero finding for univariate functions
- Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function
Cited in
(18)- Average errors for zero finding: Lower bounds
- Why does information-based complexity use the real number model?
- Efficient hybrid algorithms for finding zeros of convex functions
- Combining binary search and Newton's method to compute real roots for a class of real functions
- A new trigonometrical algorithm for computing real root of non-linear transcendental equations
- Lower bound on complexity of optimization of continuous functions
- A modified Brent's method for finding zeros of functions
- A method to accelerate the convergence of the secant algorithm
- A note on two fixed point problems
- scientific article; zbMATH DE number 4070191 (Why is no real title available?)
- scientific article; zbMATH DE number 1206072 (Why is no real title available?)
- New algorithms for computing a root of non-linear equations using exponential series
- Adaptive approximation of the minimum of Brownian motion
- A lower bound on complexity of optimization under the \(r\)-fold integrated Wiener measure
- Average-case results for zero finding
- ON NEW HYBRID ROOT-FINDING ALGORITHMS FOR SOLVING TRANSCENDENTAL EQUATIONS USING EXPONENTIAL AND HALLEY'S METHODS
- Derivative-free root-finding algorithms: perpendicular and extended secant methods with CESTAC validation
- Determining zeroes of increasing Lipschitz functions
This page was built for publication: Average-Case Optimality of a Hybrid Secant-Bisection Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4878510)
