Numerical methods for finding global extrema (Case of a non-uniform mesh)
From MaRDI portal
Publication:5675558
DOI10.1016/0041-5553(71)90065-6zbMath0258.90045OpenAlexW2054494604MaRDI QIDQ5675558
Publication date: 1973
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(71)90065-6
Related Items (37)
Method for constructing an external polyhedral estimate of the trajectory tube for a nonlinear dynamic system ⋮ Adaptive global optimization based on a block-recursive dimensionality reduction scheme ⋮ An algorithm for global optimization of Lipschitz continuous functions ⋮ Efficient unconstrained black box optimization ⋮ Approximation of the effective hull of a nonconvex multidimensional set given by a nonlinear mapping ⋮ Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions ⋮ Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints ⋮ A Deterministic Algorithm for Global Optimization ⋮ A deterministic algorithm for global multi-objective optimization ⋮ Global and local optimization in identification of parabolic systems ⋮ Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics ⋮ Method for solving constrained multicriteria optimization problems with guaranteed accuracy ⋮ Optimization methods as applied to parametric identification of interatomic potentials ⋮ Optimization algorithm for approximating the solutions set of nonlinear inequalities systems in the problem of determining the robot workspace ⋮ A deterministic approach to global box-constrained optimization ⋮ An information global minimization algorithm using the local improvement technique ⋮ Mathematical modeling of the Wuhan COVID-2019 epidemic and inverse problems ⋮ Recent Theoretical Advances in Non-Convex Optimization ⋮ A direct search algorithm for global optimization ⋮ Unconstrained and constrained global optimization of polynomial functions in one variable ⋮ A global minimization algorithm for Lipschitz functions ⋮ A hybrid algorithm for finding a global minimum ⋮ Convergence qualification of adaptive partition algorithms in global optimization ⋮ Method for constructing optimal dark coverings ⋮ Global optimization of univariate Lipschitz functions. I: Survey and properties ⋮ Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison ⋮ Rounding on the standard simplex: regular grids for global optimization ⋮ Global minimization of univariate functions by sequential polynomial approximation ⋮ On the global optimization properties of finite-difference local descent algorithms ⋮ Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties ⋮ Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints ⋮ Global optimization using interval analysis: The one-dimensional case ⋮ A decomposition method for MINLPs with Lipschitz continuous nonlinearities ⋮ Accelerations for global optimization covering methods using second derivatives ⋮ Effective hull of a set and its approximation ⋮ Cord-slope form of Taylor's expansion in univariate global optimization ⋮ A parallel method for finding the global minimum of univariate functions
This page was built for publication: Numerical methods for finding global extrema (Case of a non-uniform mesh)
