A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
From MaRDI portal
Publication:386486
DOI10.1007/s10898-012-0020-3zbMath1279.65076OpenAlexW2069391269MaRDI QIDQ386486
Rudolf Scitovski, Emmanuel Karlo Nyarko, Ratko Grbić
Publication date: 9 December 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-0020-3
global optimizationnumerical examplessymmetric function\texttt{DIRECT} (DIviding RECTangles) methodcenter-based clusteringcomplex center-based clustering problemsLipschitz continuous function
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Combinatorial optimization (90C27)
Related Items
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, Adaptive block coordinate DIRECT algorithm, 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, Interpretation and optimization of the \(k\)-means algorithm., Searching for an Optimal Partition of Incomplete Data with Application in Modeling Energy Efficiency of Public Buildings, Parameter estimation in ordinary differential equations modeling via particle swarm optimization, 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, Incremental method for multiple line detection problem -- iterative reweighted approach, The DIRECT algorithm: 25 years later, A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem, The adaptation of the \(k\)-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm., A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem, SymDIRECT, Center-based l1–clustering method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Equivalent formulations of the gradient
- A modified DIviding RECTangles algorithm for a problem in astrophysics
- The big cube small cube solution method for multidimensional facility location problems
- A review of recent advances in global optimization
- A filled function method applied to nonsmooth constrained global optimization
- DIRECT algorithm: A new definition of potentially optimal hyperrectangles
- Additive scaling and the \texttt{DIRECT} algorithm
- A new exclusion test for finding the global minimum
- A generalized Weiszfeld method for the multi-facility location problem
- A toolbox for \(K\)-centroids cluster analysis
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Extension of Piyavskii's algorithm to continuous global optimization
- Global optimization by multilevel coordinate search
- Lipschitzian optimization without the Lipschitz constant
- Handbook of global optimization
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- TRIOPT: A triangulation-based partitioning algorithm for global optimization
- Solving the parameter identification problem of mathematical models using genetic algorithms
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
- A taxonomy of global optimization methods based on response surfaces
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Estimation of the Lipschitz constant of a function
- One-dimensional center-based l 1-clustering method
- A new sampling method in the DIRECT algorithm
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- Stochastic global optimization.
- A global minimization algorithm for Lipschitz functions
- Building initial partitions through sampling techniques
- Asynchronous parallel hybrid optimization combining DIRECT and GSS
- Firefly Algorithms for Multimodal Optimization
- Complete search in continuous global optimization and constraint satisfaction
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- A Sequential Method Seeking the Global Maximum of a Function
- Data Clustering: Theory, Algorithms, and Applications
- A locally-biased form of the DIRECT algorithm.
