A deterministic global optimization using smooth diagonal auxiliary functions
From MaRDI portal
Publication:907200
DOI10.1016/j.cnsns.2014.08.026zbMath1329.90112arXiv1509.04518OpenAlexW2138514085MaRDI QIDQ907200
Yaroslav D. Sergeyev, Dmitri E. Kvasov
Publication date: 25 January 2016
Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.04518
Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (24)
Simulation of hybrid systems under Zeno behavior using numerical infinitesimals ⋮ Best practices for comparing optimization algorithms ⋮ Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints ⋮ Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes ⋮ A novel modeling and smoothing technique in global optimization ⋮ Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem ⋮ Global optimization method with numerically calculated function derivatives ⋮ On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization ⋮ Preface to the special issue NUMTA 2013 ⋮ A hybrid of Bayesian approach based global search with clustering aided local refinement ⋮ Multidimensional Global Search Using Numerical Estimations of Minimized Function Derivatives and Adaptive Nested Optimization Scheme ⋮ Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant ⋮ Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms ⋮ On convergence rate of a rectangular partition based global optimization algorithm ⋮ Bayesian optimization of pump operations in water distribution systems ⋮ MSO: a framework for bound-constrained black-box global optimization algorithms ⋮ A \textsc{direct}-type global optimization algorithm for image registration ⋮ A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem ⋮ Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants ⋮ Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization ⋮ Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces ⋮ Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization ⋮ Multidimensional global optimization using numerical estimates of objective function derivatives ⋮ On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- A modified DIviding RECTangles algorithm for a problem in astrophysics
- Chaos-enhanced accelerated particle swarm optimization
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Global optimization requires global information
- Efficient global optimization of expensive black-box functions
- Global one-dimensional optimization using smooth auxiliary functions
- Lipschitzian optimization without the Lipschitz constant
- A parallel method for finding the global minimum of univariate functions
- 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
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
- A set of examples of global and discrete optimization. Applications of Bayesian heuristic approach
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- One-dimensional P-algorithm with convergence rate \(O(n^{-3+\delta})\) for smooth functions
- Handbook of global optimization. Vol. 2
- A deterministic algorithm for global optimization
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- An information global minimization algorithm using the local improvement technique
- Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives
- Simplicial Lipschitz optimization without the Lipschitz constant
- Globally-biased disimpl algorithm for expensive global optimization
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Stochastic global optimization.
- Global optimization in engineering design
- Introduction to Global Optimization Exploiting Space-Filling Curves
- Simplicial Global Optimization
- An application of the nonuniform covering method to global optimization of mixed integer nonlinear problems
- Sequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization
- Direct Multisearch for Multiobjective Optimization
- Stochastic Optimization
- A global minimization algorithm with parallel iterations
- Encyclopedia of Optimization
- Introduction to Derivative-Free Optimization
- Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
- 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
- A locally-biased form of the DIRECT algorithm.
This page was built for publication: A deterministic global optimization using smooth diagonal auxiliary functions
