A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
From MaRDI portal
Publication:386486
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
Cites work
- scientific article; zbMATH DE number 5957421 (Why is no real title available?)
- scientific article; zbMATH DE number 3852234 (Why is no real title available?)
- scientific article; zbMATH DE number 5510565 (Why is no real title available?)
- scientific article; zbMATH DE number 3718485 (Why is no real title available?)
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- scientific article; zbMATH DE number 2035082 (Why is no real title available?)
- scientific article; zbMATH DE number 5686753 (Why is no real title available?)
- scientific article; zbMATH DE number 3395303 (Why is no real title available?)
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- A Sequential Method Seeking the Global Maximum of a Function
- A filled function method applied to nonsmooth constrained global optimization
- A generalized Weiszfeld method for the multi-facility location problem
- A global minimization algorithm for Lipschitz functions
- A locally-biased form of the DIRECT algorithm.
- A modified DIviding RECTangles algorithm for a problem in astrophysics
- A new exclusion test for finding the global minimum
- A new sampling method in the DIRECT algorithm
- A review of recent advances in global optimization
- A taxonomy of global optimization methods based on response surfaces
- A toolbox for \(K\)-centroids cluster analysis
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Additive scaling and the \texttt{DIRECT} algorithm
- Asynchronous parallel hybrid optimization combining DIRECT and GSS
- Building initial partitions through sampling techniques
- Complete search in continuous global optimization and constraint satisfaction
- DIRECT algorithm: A new definition of potentially optimal hyperrectangles
- Data Clustering: Theory, Algorithms, and Applications
- Equivalent formulations of the gradient
- Estimation of the Lipschitz constant of a function
- Extension of Piyavskii's algorithm to continuous global optimization
- Firefly Algorithms for Multimodal Optimization
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Global optimization by multilevel coordinate search
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Handbook of global optimization
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
- Introduction to clustering large and high-dimensional data.
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- Lipschitzian optimization without the Lipschitz constant
- On the Pareto optimality in the context of Lipschitzian optimization
- One-dimensional center-based l 1-clustering method
- Solving the parameter identification problem of mathematical models using genetic algorithms
- Stochastic global optimization.
- TRIOPT: A triangulation-based partitioning algorithm for global optimization
- The big cube small cube solution method for multidimensional facility location problems
- Univariate geometric Lipschitz global optimization algorithms
Cited in
(18)- Interpretation and optimization of the \(k\)-means algorithm.
- DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization
- Globally-biased disimpl algorithm for expensive global 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 combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem
- The DIRECT algorithm: 25 years later
- Parameter estimation in ordinary differential equations modeling via particle swarm optimization
- Adaptive block coordinate DIRECT algorithm
- SymDIRECT
- A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
- 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
- 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
- A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- Simplicial Lipschitz optimization without the Lipschitz constant
- Center-based \(l_1\)-clustering method
- Searching for an optimal partition of incomplete data with application in modeling energy efficiency of public buildings
- Incremental method for multiple line detection problem -- iterative reweighted approach
Describes a project that uses
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)
