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-3zbMATH Open1279.65076OpenAlexW2069391269MaRDI QIDQ386486FDOQ386486
Authors: Ratko Grbić, Emmanuel Karlo Nyarko, Rudolf Scitovski 
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
Recommendations
- 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
- Modified DIRECT Algorithm for Scaled Global Optimization Problems
- Simplicial Lipschitz optimization without the Lipschitz constant
- Diagonal generalizaton of the DIRECT method for problems with constraints
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
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) Combinatorial optimization (90C27) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- A toolbox for \(K\)-centroids cluster analysis
- TRIOPT: A triangulation-based partitioning algorithm for global optimization
- A taxonomy of global optimization methods based on response surfaces
- Firefly Algorithms for Multimodal Optimization
- A locally-biased form of the DIRECT algorithm.
- Lipschitzian optimization without the Lipschitz constant
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Handbook of global optimization
- A generalized Weiszfeld method for the multi-facility location problem
- Solving the parameter identification problem of mathematical models using genetic algorithms
- Introduction to clustering large and high-dimensional data.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A review of recent advances in global optimization
- Extension of Piyavskii's algorithm to continuous global optimization
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- A filled function method applied to nonsmooth constrained global optimization
- Complete search in continuous global optimization and constraint satisfaction
- The big cube small cube solution method for multidimensional facility location problems
- Title not available (Why is that?)
- Data Clustering: Theory, Algorithms, and Applications
- Global optimization by multilevel coordinate search
- Asynchronous parallel hybrid optimization combining DIRECT and GSS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- A Sequential Method Seeking the Global Maximum of a Function
- Stochastic global optimization.
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
- 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
- A global minimization algorithm for Lipschitz functions
- Building initial partitions through sampling techniques
- Title not available (Why is that?)
- Title not available (Why is that?)
- Univariate geometric Lipschitz global optimization algorithms
- On the Pareto optimality in the context of Lipschitzian optimization
- Equivalent formulations of the gradient
- A modified DIviding RECTangles algorithm for a problem in astrophysics
- 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
Cited In (18)
- Globally-biased disimpl algorithm for expensive global optimization
- DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization
- A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets
- Incremental method for multiple line detection problem -- iterative reweighted approach
- 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
- Simplicial Lipschitz optimization without the Lipschitz constant
- A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem
- The DIRECT algorithm: 25 years later
- A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
- Interpretation and optimization of the \(k\)-means algorithm.
- SymDIRECT
- Parameter estimation in ordinary differential equations modeling via particle swarm optimization
- 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 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
- Searching for an optimal partition of incomplete data with application in modeling energy efficiency of public buildings
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- Center-based \(l_1\)-clustering method
Uses Software
This page was built for publication: A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386486)
