On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
From MaRDI portal
Publication:5270520
DOI10.1007/978-3-319-18567-5_16zbMath1365.90222OpenAlexW2340181778MaRDI QIDQ5270520
Dmitri E. Kvasov, Yaroslav D. Sergeyev
Publication date: 23 June 2017
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18567-5_16
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items (3)
Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants ⋮ A deterministic method for continuous global optimization using a dense curve ⋮ Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- Univariate geometric Lipschitz global optimization algorithms
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Stochastic algorithms for solving structured low-rank matrix approximation problems
- A deterministic global optimization using smooth diagonal auxiliary functions
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Multidimensional Lipschitz global optimization based on efficient diagonal partitions
- Extended univariate algorithms for \(n\)-dimensional global optimization
- Global one-dimensional optimization using smooth auxiliary functions
- Accelerations for global optimization covering methods using second derivatives
- Lipschitzian optimization without the Lipschitz constant
- Handbook of global optimization
- Parallel characteristical algorithms for solving problems of global optimization
- A global optimization algorithm for multivariate functions with Lipschitzian first derivatives
- Local tuning and partition strategies for diagonal GO methods
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms
- A deterministic algorithm for global optimization
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- A one-dimensional deterministic global minimization algorithm
- A deterministic approach to global box-constrained optimization
- An information global minimization algorithm using the local improvement technique
- Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives
- Globally-biased disimpl algorithm for expensive global optimization
- A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
- Optimization challenges in the structured low rank approximation problem
- Stochastic global optimization.
- Introduction to Global Optimization Exploiting Space-Filling Curves
- Simplicial Global Optimization
- Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
- An Information Global Optimization Algorithm with Local Tuning
- On convergence of "divide the best" global optimization algorithms
- Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
- Algorithm 829
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- Acceleration tools for diagonal information global optimization
- Multidimensional global optimization using the first derivatives
This page was built for publication: On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
