Convergence qualification of adaptive partition algorithms in global optimization
From MaRDI portal
The author considers the optimization problem \(\min f(x)\), subject to \(x\in M\), where \(M\) is a bounded set, which is a closure of a non-empty open set of the real Euclidean \(n\)-space. The objective function \(f\) is continuous and may be multiextremal on \(M\). A general class of methods solving this problem via ``complete partition and search of \(M\) is investigated. Necessary and sufficient convergence conditions are formulated.
Recommendations
Cites work
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- A method for globally minimizing concave functions over convex sets
- A note on the convergence of an algorithm for nonconvex programming problems
- A probabilistic algorithm for global optimization
- A Sequential Method Seeking the Global Maximum of a Function
- A stochastic method for global optimization
- An algorithm for finding the absolute extremum of a function
- An algorithm for finding the global maximum of a multimodal, multivariate function
- An algorithm for global optimization of Lipschitz continuous functions
- An algorithm for nonconvex programming problems
- An Algorithm for Separable Nonconvex Programming Problems
- An analytical approach to global optimization
- An application of Lipschitzian global optimization to product design
- An interval version of Shubert's iterative method for the localization of the global maximum
- Axiomatic approach to statistical models and their use in multimodal optimization theory
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- Constrained global optimization: algorithms and applications
- Convergence properties of stochastic optimization procedures
- Convergent Algorithms for Minimizing a Concave Function
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions
- Estimation of the efficiency of an absolute-minimum-finding algorithm
- Extended univariate algorithms for n-dimensional global optimization
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- Global optimization of univariate Lipschitz functions. I: Survey and properties
- Global optimization on convex sets
- Global optimization using interval analysis - the multi-dimensional case
- Global optimization using interval analysis: The one-dimensional case
- Globally convergent methods for n-dimensional multiextremal optimization
- Globally optimized calibration of environmental models
- scientific article; zbMATH DE number 3965348 (Why is no real title available?)
- scientific article; zbMATH DE number 3670184 (Why is no real title available?)
- scientific article; zbMATH DE number 3718485 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- scientific article; zbMATH DE number 3485507 (Why is no real title available?)
- scientific article; zbMATH DE number 3612796 (Why is no real title available?)
- Inclusion functions and global optimization
- Iterative Methods for the Localization of the Global Maximum
- Minimization by Random Search Techniques
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
- On a sequential search strategy in global optimization problems
- On the convergence of global methods in multiextremal optimization
- On the convergence of two branch-and-bound algorithms for nonconvex programming problems
- On the global minimization of concave functions
- Optimal Search for the Global Maximum of Functions with Bounded Seminorm
- Precision, complexity, and computational schemes of the cubic algorithms
- Progressive global random search of continuous functions
- Set partition by globally optimized cluster seed points
- Solving nonlinear equation systems via global partition and search: Some experimental results
- Stochastic global optimization methods part I: Clustering methods
- Stochastic global optimization methods part II: Multi level methods
- Two algorithms for one-dimensional multimodai minimization
Cited in
(26)- On the convergence of global methods in multiextremal optimization
- Optimality tests for partitioning and sectional search algorithms
- Global one-dimensional optimization using smooth auxiliary functions
- On convergence conditions of partitioned solution procedures for consolidation problems
- A multivariate partition approach to optimization problems
- On the efficiency of a global non-differentiable optimization algorithm based on the method of optimal set partitioning
- Experiments with new stochastic global optimization search techniques
- Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
- On convergence rate of a rectangular partition based global optimization algorithm
- TRIOPT: A triangulation-based partitioning algorithm for global optimization
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- An intelligent decision support system for assisting industrial wastewater management
- An algorithm for solving global optimization problems with nonlinear constraints
- \textsc{Oscars}-II: an algorithm for bound constrained global optimization
- One side cut accelerated random search
- A global minimization algorithm for Lipschitz functions
- The robust constant and its applications in random global search for unconstrained global optimization
- A cover partitioning method for bound constrained global optimization
- A two phase local global search algorithm using new global search strategy
- On the convergence of adaptive partition algorithms in global optimization
- On convergence of "divide the best" global optimization algorithms
- scientific article; zbMATH DE number 223553 (Why is no real title available?)
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- An efficient global optimization algorithm with adaptive estimates of the local Lipschitz constants
- Global convergence revisited: Reply to A. Žilinskas
- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms
This page was built for publication: Convergence qualification of adaptive partition algorithms in global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196187)
