Numerical experiments with the one-dimensional non-linear simplex search

DOI10.1016/0305-0548(91)90055-VzbMath0747.90092OpenAlexW2094960246MaRDI QIDQ1184438

Ayoade Kuye

Publication date: 28 June 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(91)90055-v

zbMATH Keywords

1-D simplex search algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• One-dimensional simplex search
• On the convergence of one-dimensional simplex search
• Solving the nonlinear least square problem: Application of a general method
• Convergence Properties of Algorithms for Nonlinear Optimization
• Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
• The Modified Gauss-Newton Method for the Fitting of Non-Linear Regression Functions by Least Squares
• Algorithms Supplement
• A Quasi-Newton Method with No Derivatives
• Numerical Solution of Systems of Nonlinear Equations
• A Rapidly Convergent Descent Method for Minimization
• Function minimization by conjugate gradients
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• Maximization by Quadratic Hill-Climbing
• Minimizing a function without calculating derivatives
• Modified Damped Least Squares: An Algorithm for Non-linear Estimation

This page was built for publication: Numerical experiments with the one-dimensional non-linear simplex search