Simplicial global optimization
From MaRDI portal
Publication:2851341
DOI10.1007/978-1-4614-9093-7zbMATH Open1401.90017OpenAlexW60763295MaRDI QIDQ2851341FDOQ2851341
Authors: Remigijus Paulavičius, Julius Žilinskas 
Publication date: 10 October 2013
Published in: SpringerBriefs in Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-9093-7
Recommendations
- Simplicial Lipschitz optimization without the Lipschitz constant
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Deterministic global optimization. Geometric branch-and-bound methods and their applications
- A new simplicial cover technique in constrained global optimization
Management decision making, including multiple objectives (90B50) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cited In (73)
- Globally-biased disimpl algorithm for expensive global optimization
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Computing an upper bound on contact stress with surrogate duality
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- A Search Algorithm for the Global Extremum of a Discontinuous Function
- Visualization of a statistical approximation of the Pareto front
- Rounding on the standard simplex: regular grids for global optimization
- On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- Title not available (Why is that?)
- An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
- Globally maximizing the sum of squares of quadratic forms over the unit sphere
- 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
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- On the least-squares fitting of data by sinusoids
- On refinement of the unit simplex using regular simplices
- On deterministic diagonal methods for solving global optimization problems with Lipschitz gradients
- A \textsc{direct}-type global optimization algorithm for image registration
- A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem
- On the search of the shape parameter in radial basis functions using univariate global optimization methods
- A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
- An accelerated algorithm for finding efficient solutions in multiobjective problems with black-box multiextremal criteria
- Survey of piecewise convex maximization and PCMP over spherical sets
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
- Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
- A direct search algorithm for global optimization
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
- On the exhaustivity of simplicial partitioning
- The simplex method as a global optimizer: A \(C\)-programming perspective
- Approximating a solution set of nonlinear inequalities
- Granular sieving algorithm for selecting best n$$ n $$ parameters
- Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
- Generalized parallel computational schemes for time-consuming global optimization
- Multidimensional global optimization using numerical estimates of objective function derivatives
- Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization
- On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
- Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems
- A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
- ON THE ACCURACY OF SOME ABSORBING BOUNDARY CONDITIONS FOR THE SCHRODINGER EQUATION
- 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
- MSO: a framework for bound-constrained black-box global optimization algorithms
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- Efficient multicriterial optimization based on intensive reuse of search information
- 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
- On convergence rate of a rectangular partition based global optimization algorithm
- A deterministic global optimization using smooth diagonal auxiliary functions
- On parallel branch and bound frameworks for global optimization
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics
- A simplicial homology algorithm for Lipschitz optimisation
- A hybrid of Bayesian approach based global search with clustering aided local refinement
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
- 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
- Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme
- A hybrid of Bayesian-based global search with Hooke-Jeeves local refinement for multi-objective optimization problems
- An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework
- Numerical methods using two different approximations of space-filling curves for black-box global optimization
- Mathematically Rigorous Global Optimization and Fuzzy Optimization
- A Partition Based Bayesian Multi-objective Optimization Algorithm
- On dealing with minima at the border of a simplicial feasible area in simplicial branch and bound
- Hyperparameter autotuning of programs with HybridTuner
- (Global) optimization: historical notes and recent developments
- Hybrid simplicial-randomized approximate stochastic dynamic programming for multireservoir optimization
- Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots
- Global optimization method with numerically calculated function derivatives
This page was built for publication: Simplicial global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851341)
