[BOOK][B] Simplicial partitions in global optimization
R Paulavičius, J Žilinskas, R Paulavičius, J Žilinskas - 2014 - Springer
Simplicial Partitions in Global Optimization | SpringerLink Skip to main content
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your …
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your …
[BOOK][B] Non-convex multi-objective optimization
Optimization is a very broad field of research with a wide spectrum of important applications.
Until the 1950s, optimization was understood as a single-objective optimization, ie, as the …
Until the 1950s, optimization was understood as a single-objective optimization, ie, as the …
DIRECTGO: A New DIRECT-Type MATLAB Toolbox for Derivative-Free Global Optimization
In this work, we introduce DIRECTGO, a new MATLAB toolbox for derivative-free global
optimization. DIRECTGO collects various deterministic derivative-free DIRECT-type …
optimization. DIRECTGO collects various deterministic derivative-free DIRECT-type …
An empirical study of various candidate selection and partitioning techniques in the DIRECT framework
Over the last three decades, many attempts have been made to improve the DIRECT
(DIviding RECTangles) algorithm's efficiency. Various novel ideas and extensions have …
(DIviding RECTangles) algorithm's efficiency. Various novel ideas and extensions have …
An extensive numerical benchmark study of deterministic vs. stochastic derivative-free global optimization algorithms
Research in derivative-free global optimization is under active development, and many
solution techniques are available today. Therefore, the experimental comparison of previous …
solution techniques are available today. Therefore, the experimental comparison of previous …
Parallel branch and bound for global optimization with combination of lipschitz bounds
The solution of multidimensional Lipschitz optimization problem requires a lot of computing
time and memory resources. Parallel OpenMP and MPI versions of branch and bound …
time and memory resources. Parallel OpenMP and MPI versions of branch and bound …
Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
Speed and memory requirements of branch and bound algorithms depend on the selection
strategy of which candidate node to process next. The goal of this paper is to experimentally …
strategy of which candidate node to process next. The goal of this paper is to experimentally …
Girls' interest in STEM
HD Burns, K Lesseig, N Staus - 2016 IEEE Frontiers in …, 2016 - ieeexplore.ieee.org
This is a work-in-progress. The dramatic decline in youth interest in science, technology,
engineering and mathematics (STEM) during adolescence has been a phenomenon of …
engineering and mathematics (STEM) during adolescence has been a phenomenon of …
Interval arithmetic based optimization in nonlinear regression
Interval Arithmetic Based Optimization in Nonlinear Regression Page 1 INFORMATICA, 2010,
Vol. 21, No. 1, 149–158 149 © 2010 Institute of Mathematics and Informatics, Vilnius Interval …
Vol. 21, No. 1, 149–158 149 © 2010 Institute of Mathematics and Informatics, Vilnius Interval …
Global optimization using the branch‐and‐bound algorithm with a combination of Lipschitz bounds over simplices
Many problems in economy may be formulated as global optimization problems. Most
numerically promising methods for solution of multivariate unconstrained Lipschitz …
numerically promising methods for solution of multivariate unconstrained Lipschitz …