A hybrid algorithm for finding a global minimum

DOI10.1080/00207178308933020zbMath0527.49026OpenAlexW1992858878MaRDI QIDQ3308652

No author found.

Publication date: 1983

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207178308933020

zbMATH Keywords

convergenceglobal minimumrandom optimizationdescent algorithmshybrid algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Newton-type methods (49M15) Sensitivity, stability, parametric optimization (90C31) Stochastic programming (90C15) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52) Mathematical programming (90C99)

Related Items

A homotopy approach to improving PEM identification of ARMAX models

Cites Work

• Unnamed Item
• A modified convergence theorem for a random optimization method
• The \(\Psi\)-transform for solving linear and non-linear programming problems
• Die Konvergenzordnung des Fletcher-Powell-Algorithmus
• Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
• Practical convergence conditions for the Davidon-Fletcher-Powell method
• Quasi-Newton Methods, Motivation and Theory
• Rate of Convergence of Several Conjugate Gradient Algorithms
• On the rate of convergence of the conjugate gradient reset method with inaccurate linear minimizations
• Function minimization by conjugate gradients
• On the Convergence of the Variable Metric Algorithm
• A Sequential Method Seeking the Global Maximum of a Function
• Numerical methods for finding global extrema (Case of a non-uniform mesh)