On the global optimization properties of finite-difference local descent algorithms
type: Item
instance of: scholarly article
title: On the global optimization properties of finite-difference local descent algorithms
zbMATH Open document ID: 0796.90062
DOI: 10.1007/BF01100240
author: S. K. Zavriev
published in: Journal of Global Optimization
publication date: 1993-05-04T00:00:00Z
review text: The global optimization problem (1) \(F(x)\to \inf_{x\in E_ k}\) with \(E_ k\) a \(k\)-dimensional Euclidean space is investigated for (1) \(\gamma\)-convex structured, that is there exists a strongly convex (with parameter \(\ell>0\)) and differentiable function \(\Phi(\cdot)\), \(\nabla\phi(\cdot)\) Lipschitzian with parameter \(L\), such that \(|\Phi(x)- F(x)|\leq \gamma\), \(\forall x\in E_ k\). The function \(\Phi(\cdot)\) is called strongly convex in \(E_ k\) with parameter \(\ell>0\), if \[ \Phi(\lambda x_ 1+ (1-\lambda)x_ 2)\leq \lambda \Phi(x_ 1)+ (1-\lambda)\Phi(x_ 2)- \ell\lambda(1-\lambda)\| x_ 1- x_ 2\|^ 2/2 \] for any \(x_ 1,x_ 2\in E_ k\) and \(\lambda\), \(0\leq \lambda\leq 1\). The author considers first a perturbed gradient descent method to approximating the global minimum of \(\Phi(x)\), then based on that introduces a finite difference algorithm aimed to solve approximately (1). Following the same approach he investigates the convergence properties of a coordinate descent method.
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 151887
zbMATH Keywords: global optimization
zbMATH Keywords: perturbed gradient descent method
reviewed by: Marco Gaviano
MaRDI profile type: Publication
cites work: Optimization of Globally Convex Functions
cites work: Nondifferential optimization via adaptive smoothing
cites work: A Stability Analysis for Perturbed Nonlinear Iterative Methods
cites work: Q3491338
cites work: Q3679813
cites work: Approximate calculation of a pseudoinverse matrix using a generalized discrepancy principle
cites work: Convergence properties of the gradient method under conditions of variable-level interference
cites work: Q3925090
cites work: Q3688092
cites work: Numerical methods for finding global extrema (Case of a non-uniform mesh)
cites work: A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
Recommended article: On a local and global search involved in nonconvex optimization problems
Recommended article: From global to local convergence of interior methods for nonlinear optimization
Recommended article: Global descent methods for unconstrained global optimization
Recommended article: Q4543380
Recommended article: Global and local quadratic minimization
Recommended article: On the use of finite differences in the multistart method for solving a certain class of global optimization
Recommended article: Global Convergence Properties of Conjugate Gradient Methods for Optimization
Recommended article: Q4640536
Recommended article: On the local convergence of the Douglas-Rachford algorithm
description: scientific article; zbMATH DE number 151887