On the global optimization properties of finite-difference local descent algorithms
From MaRDI portal
Recommendations
- On a local and global search involved in nonconvex optimization problems
- From global to local convergence of interior methods for nonlinear optimization
- Global descent methods for unconstrained global optimization
- scientific article; zbMATH DE number 1780125
- Global and local quadratic minimization
- On the use of finite differences in the multistart method for solving a certain class of global optimization
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence of a class of sufficient descent conjugate gradient methods
- On the local convergence of the Douglas-Rachford algorithm
Cites work
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 3901529 (Why is no real title available?)
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 3738825 (Why is no real title available?)
- A Stability Analysis for Perturbed Nonlinear Iterative Methods
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Approximate calculation of a pseudoinverse matrix using a generalized discrepancy principle
- Convergence properties of the gradient method under conditions of variable-level interference
- Nondifferential optimization via adaptive smoothing
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
- Optimization of Globally Convex Functions
Cited in
(6)- On the use of finite differences in the multistart method for solving a certain class of global optimization
- Parallel versions of the modified coordinate and gradient descent methods and their application to a class of global optimization problems
- Strongly convex set-valued maps
- Zeroth-order optimization with orthogonal random directions
- Robust descent in differentiable optimization using automatic finite differences
- Perturbed steepest-descent technique in multiextremal problems
This page was built for publication: On the global optimization properties of finite-difference local descent algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207044)
