Numerical experiments with the one-dimensional non-linear simplex search
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3115465 (Why is no real title available?)
- scientific article; zbMATH DE number 3687182 (Why is no real title available?)
- scientific article; zbMATH DE number 3446326 (Why is no real title available?)
- scientific article; zbMATH DE number 3356498 (Why is no real title available?)
- A Quasi-Newton Method with No Derivatives
- A Rapidly Convergent Descent Method for Minimization
- Algorithms Supplement
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Convergence Properties of Algorithms for Nonlinear Optimization
- Function minimization by conjugate gradients
- Maximization by Quadratic Hill-Climbing
- Minimizing a function without calculating derivatives
- Modified Damped Least Squares: An Algorithm for Non-linear Estimation
- Numerical Solution of Systems of Nonlinear Equations
- On the convergence of one-dimensional simplex search
- One-dimensional simplex search
- Solving the nonlinear least square problem: Application of a general method
- The Modified Gauss-Newton Method for the Fitting of Non-Linear Regression Functions by Least Squares
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
Cited in
(4)
This page was built for publication: Numerical experiments with the one-dimensional non-linear simplex search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184438)