A hybrid algorithm for finding a global minimum

DOI10.1080/00207178308933020MaRDI QIDQ3308652zbMATH OpenOpenAlexFDO

Authors

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

convergencedescent algorithmsglobal minimumhybrid algorithmrandom optimization

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(1)

• A homotopy approach to improving PEM identification of ARMAX models

This page was built for publication: A hybrid algorithm for finding a global minimum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3308652)