Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
From MaRDI portal
Publication:5963229
DOI10.1007/s11590-014-0772-4zbMath1342.90151OpenAlexW2110446256MaRDI QIDQ5963229
Remigijus Paulavičius, Julius Žilinskas
Publication date: 4 March 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0772-4
Related Items (16)
Adaptive global optimization based on a block-recursive dimensionality reduction scheme ⋮ Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints ⋮ 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 ⋮ Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization ⋮ Book review of: R. Paulavičius and J. Žilinskas: Simplicial 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 ⋮ A simplicial homology algorithm for Lipschitz optimisation ⋮ Sequential model based optimization of partially defined functions under unknown constraints ⋮ A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem ⋮ Preface to the special issue ``Recent developments in non-linear and global optimization ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- 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
- 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
- Checking local optimality in constrained quadratic programming is NP- hard
- Global optimization by multilevel coordinate search
- Lipschitzian optimization without the Lipschitz constant
- Handbook of global optimization
- Index information algorithm with local tuning for solving multidimensional global optimization problems with multiextremal constraints
- Dynamic data structures for a direct search algorithm
- 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 deterministic approach to global box-constrained optimization
- A partition-based global optimization algorithm
- Simplicial Lipschitz optimization without the Lipschitz constant
- Globally-biased disimpl algorithm for expensive global optimization
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Simplicial Global Optimization
- PSwarm: a hybrid solver for linearly constrained global derivative-free optimization
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- Introduction to Derivative-Free Optimization
- Some NP-complete problems in quadratic and nonlinear programming
- Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
- A locally-biased form of the DIRECT algorithm.
- Using DIRECT to solve an aircraft routing problem
This page was built for publication: Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
