Extended global convergence framework for unconstrained optimization

DOI10.1007/S10114-004-0340-4zbMath1069.90114OpenAlexW2021856041MaRDI QIDQ1882487

Iztok Fajfar, Franc Bratkovič, Tadej Tuma, Janez Puhan, Árpád Bűrmen

Publication date: 1 October 2004

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-004-0340-4

zbMATH Keywords

convergence analysisderivative free optimizationdescent methodsgrid-based optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (1)

The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global convergence and stabilization of unconstrained minimization methods without derivatives
• Direct search methods: Then and now
• On the Convergence of Grid-Based Methods for Unconstrained Optimization
• On the Convergence of Pattern Search Algorithms
• On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
• Theory of Positive Linear Dependence

This page was built for publication: Extended global convergence framework for unconstrained optimization