A hybrid algorithm for finding a global minimum

DOI10.1080/00207178308933020zbMATH Open0527.49026OpenAlexW1992858878MaRDI QIDQ3308652FDOQ3308652

Author name not available (Why is that?)

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

convergencehybrid algorithmglobal minimumrandom optimizationdescent algorithms

Mathematics Subject Classification ID

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

Cites Work

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

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)