Adaptive block coordinate DIRECT algorithm
From MaRDI portal
Publication:1685578
DOI10.1007/s10898-017-0541-xzbMath1385.90022arXiv1612.08786OpenAlexW2567055808MaRDI QIDQ1685578
Shuning Wang, Li Li, Qinghua Tao, Xiao Lin Huang
Publication date: 14 December 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.08786
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- A modified DIRECT algorithm with bilevel partition
- Global optimization by multilevel partition
- Additive scaling and the \texttt{DIRECT} algorithm
- Global optimization by multilevel coordinate search
- Lipschitzian optimization without the Lipschitz constant
- Algorithms for noisy problems in gas transmission pipeline optimization
- Coordinate descent algorithms
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
- Insensitive Functionals, Inconsistent Gradients, Spurious Minima, and Regularized Functionals in Flow Optimization Problems
- A new algorithm for the solution of multi-state dynamic programming problems
- A Class of Decentralized Routing Algorithms Using Relaxation
- A Sequential Method Seeking the Global Maximum of a Function
- A locally-biased form of the DIRECT algorithm.
This page was built for publication: Adaptive block coordinate DIRECT algorithm
