scientific article
From MaRDI portal
Publication:3908420
zbMath0458.65062MaRDI QIDQ3908420
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
convergenceaccelerationmultimodal optimizationmulti-extremal problemsinformational-statistical algorithmsmultidimensional multimodal minimizationone-dimensional multimodal functionstesting experiments
Numerical optimization and variational techniques (65K10) Stochastic programming (90C15) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02)
Related Items
Application of Bayesian approach to numerical methods of global and stochastic optimization, On the convergence of global methods in multiextremal optimization, Adaptive global optimization based on a block-recursive dimensionality reduction scheme, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, Multifactorial global search algorithm in the problem of optimizing a reactive force field, Univariate global optimization with multiextremal non-differentiable constraints without penalty functions, Adaptive nested optimization scheme for multidimensional global search, Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems, New LP bound in multivariate Lipschitz optimization: Theory and applications, Bounds on characteristics of algorithms to find the global minimum of a function in an \(n\)-dimensional parallelepiped with prespecified accuracy, An algorithm for solving global optimization problems with nonlinear constraints, Generalized parallel computational schemes for time-consuming global optimization, Algorithms of dynamic piloted flight simulator stand based on a centrifuge with a controlled cardan suspension, Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics, Reduction of multi-extremum multi-criterion problems with constraints to unconstrained optimization problems: Theory and algorithms, Use of reference points for solving MONLP problems, A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function, On the convergence of adaptive partition algorithms in global optimization, Continuous global optimization of multivariable functions based on Sergeev and Kvasov diagonal approach, Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes, The globalized modification of Rosenbrock algorithm for finding anti-Nash equilibrium in bimatrix game, Global optimization method with numerically calculated function derivatives, A deterministic global optimization using smooth diagonal auxiliary functions, Minimization of multiextremal functions under nonconvex constraints, On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales, Global optimization based on a statistical model and simplicial partitioning., Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure, Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems, An information global minimization algorithm using the local improvement technique, On simulation of optimal strategies and Nash equilibrium in the financial market context, On similarities between two models of global optimization: Statistical models and radial basis functions, Methods of embedding-cutting off in problems of mathematical programming, Stopping rules in \(k\)-adaptive global random search algorithms, Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives, Nonparametric search optimization method, Computationally efficient approach for solving lexicographic multicriteria optimization problems, A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints, A review of statistical models for global optimization, Convergence qualification of adaptive partition algorithms in global optimization, Efficient multicriterial optimization based on intensive reuse of search information, GOSH: derivative-free global optimization using multi-dimensional space-filling curves, MSO: a framework for bound-constrained black-box global optimization algorithms, Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves, Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms, Lipschitz and Hölder global optimization using space-filling curves, Existence of a stochastic function consistent with the conditional likelihood relation, On the search of the shape parameter in radial basis functions using univariate global optimization methods, On convergence of "divide the best" global optimization algorithms, Solving nonlinear equation systems via global partition and search: Some experimental results, Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants, Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization, A software system for multiextremal optimization, On some approaches to find Nash equilibrium in concave games, Experiments with new stochastic global optimization search techniques, Global one-dimensional optimization using smooth auxiliary functions, On some optimality principles in multicriterial problems, Analysis of algorithms for a class of continuous partition problems, Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization, Extended univariate algorithms for \(n\)-dimensional global optimization, Multidimensional global optimization using numerical estimates of objective function derivatives, Set partition by globally optimized cluster seed points, A parallel method for finding the global minimum of univariate functions
