Texonom
Texonom
/
Computing
Computing
/Computing Theory/Computability Theory/Problem Solving/Optimization/
Optimization Algorithm
Search

Optimization Algorithm

Creator
Creator
Seonglae ChoSeonglae Cho
Created
Created
2023 May 16 1:40
Editor
Editor
Seonglae ChoSeonglae Cho
Edited
Edited
2025 Feb 12 23:15
Refs
Refs
Approximation theory
Parameter Estimation
Algorithm

Estimation Algorithm

Estimation Algorithms
Gradient Descent
Gauss-Newton Method
Newton–Raphson method
Root-finding Algorithm
 
 
Optimization Algorithms
Bayesian Optimization
Bayesian inference
Local Search
Combinatorial Optimization
 
 
 

Iterative models

Root-finding algorithms
In mathematics and computing, a root-finding algorithm is an algorithm for finding zeros, also called "roots", of continuous functions. A zero of a function f, from the real numbers to real numbers or from the complex numbers to the complex numbers, is a number x such that f(x) = 0. As, generally, the zeros of a function cannot be computed exactly nor expressed in closed form, root-finding algorithms provide approximations to zeros, expressed either as floating-point numbers or as small isolating intervals, or disks for complex roots (an interval or disk output being equivalent to an approximate output together with an error bound).[1]
Root-finding algorithms
https://en.wikipedia.org/wiki/Root-finding_algorithms
 
 

Recommendations

Texonom
Texonom
/
Computing
Computing
/Computing Theory/Computability Theory/Problem Solving/Optimization/
Optimization Algorithm
Copyright Seonglae Cho