Simplicial Lipschitz optimization without the Lipschitz constant
From MaRDI portal
Publication:2249819
DOI10.1007/s10898-013-0089-3zbMath1300.90031OpenAlexW2063240134MaRDI QIDQ2249819
Remigijus Paulavičius, Julius Žilinskas
Publication date: 3 July 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0089-3
global optimizationLipschitz optimizationpotentially optimal simplexsimplicial \textsc{Direct}-type algorithm
Related Items (23)
Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization ⋮ Decoupling linear and nonlinear regimes: an evaluation of efficiency for nonlinear multidimensional optimization ⋮ On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ 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 ⋮ On parallel branch and bound frameworks for 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 ⋮ On the Least-Squares Fitting of Data by Sinusoids ⋮ Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization ⋮ A new partition method for DIRECT-type algorithm based on minimax design ⋮ An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework ⋮ A deterministic global optimization using smooth diagonal auxiliary functions ⋮ Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization ⋮ Application of reduced-set Pareto-Lipschitzian optimization to truss optimization ⋮ 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 ⋮ An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section ⋮ A simplicial homology algorithm for Lipschitz optimisation ⋮ The DIRECT algorithm: 25 years later ⋮ Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints ⋮ Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} ⋮ A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints ⋮ Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces ⋮ SMGO: a set membership approach to data-driven global optimization
Uses Software
Cites Work
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
- Univariate geometric Lipschitz global optimization algorithms
- 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
- Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
- Bisecton by global optimization revisited
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Lipschitzian optimization without the Lipschitz constant
- Global optimization based on a statistical model and simplicial partitioning.
- Stochastic algorithms in nonlinear regression
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Dynamic data structures for a direct search algorithm
- Subdivision of simplices relative to a cutting plane and finite concave minimization
- A comparison of global optimization methods for the design of a high-speed civil transport
- Algorithms for noisy problems in gas transmission pipeline optimization
- Introduction to global optimization
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- A partition-based global optimization algorithm
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- A hybrid global optimization algorithm for nonlinear least squares regression
- Stochastic global optimization.
- On generalized bisection of 𝑛-simplices
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- A locally-biased form of the DIRECT algorithm.
- Using DIRECT to solve an aircraft routing problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Simplicial Lipschitz optimization without the Lipschitz constant
