Lipschitz gradients for global optimization in a one-point-based partitioning scheme
From MaRDI portal
Publication:433950
DOI10.1016/j.cam.2012.02.020zbMath1246.65091arXiv1307.4302OpenAlexW2107530185MaRDI QIDQ433950
Dmitri E. Kvasov, Yaroslav D. Sergeyev
Publication date: 9 July 2012
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.4302
algorithmglobal optimizationnumerical experimentsgeometric algorithmsLipschitz gradientsset of Lipschitz constants
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (26)
Diagonal generalizaton of the DIRECT method for problems with constraints ⋮ Convergence rate of a rectangular subdivision-based optimization algorithm for smooth multivariate functions ⋮ Adaptive nested optimization scheme for multidimensional global search ⋮ A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set ⋮ Geodesic and contour optimization using conformal mapping ⋮ A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function ⋮ Lipschitz global optimization methods in control problems ⋮ 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 ⋮ On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization ⋮ Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems ⋮ A deterministic global optimization using smooth diagonal auxiliary functions ⋮ Optimization challenges in the structured low rank approximation problem ⋮ A one-step worst-case optimal algorithm for bi-objective univariate optimization ⋮ On a global optimization algorithm for bivariate smooth functions ⋮ Application of reduced-set Pareto-Lipschitzian optimization to truss optimization ⋮ Simplicial Lipschitz optimization without the Lipschitz constant ⋮ Globally-biased disimpl algorithm for expensive global optimization ⋮ Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants ⋮ MSO: a framework for bound-constrained black-box global optimization algorithms ⋮ Incremental method for multiple line detection problem -- iterative reweighted approach ⋮ Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties ⋮ A \textsc{direct}-type global optimization algorithm for image registration ⋮ Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants ⋮ Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints ⋮ Performance of convex underestimators in a branch-and-bound framework ⋮ On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modified DIviding RECTangles algorithm for a problem in astrophysics
- A metamodel-assisted evolutionary algorithm for expensive optimization
- A fully adaptive hybrid optimization of aircraft engine blades
- Additive scaling and the \texttt{DIRECT} algorithm
- Surface passivation optimization using DIRECT
- Lipschitz and Hölder global optimization using space-filling curves
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Efficient global optimization of expensive black-box functions
- Global one-dimensional optimization using smooth auxiliary functions
- Lipschitzian optimization without the Lipschitz constant
- Handbook of global optimization
- A global optimization algorithm for multivariate functions with Lipschitzian first derivatives
- Local tuning and partition strategies for diagonal GO methods
- Introductory lectures on convex optimization. A basic course.
- A set of examples of global and discrete optimization. Applications of Bayesian heuristic approach
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Recent developments and trends in global optimization
- TRIOPT: A triangulation-based partitioning algorithm for global optimization
- Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms
- A deterministic algorithm for global optimization
- Dynamic data structures for a direct search algorithm
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- An information global minimization algorithm using the local improvement technique
- A partition-based global optimization algorithm
- Customizing methods for global optimization -- a geometric viewpoint
- Stochastic global optimization.
- A global minimization algorithm for Lipschitz functions
- Deterministic parallel global parameter estimation for a model of the budding yeast cell cycle
- An application of the nonuniform covering method to global optimization of mixed integer nonlinear problems
- Numerical Optimization
- Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
- A Complexity Analysis of Local Search Algorithms in Global Optimization
- An Information Global Optimization Algorithm with Local Tuning
- Essays and Surveys in Global Optimization
- 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: Lipschitz gradients for global optimization in a one-point-based partitioning scheme
