Convergence qualification of adaptive partition algorithms in global optimization
From MaRDI portal
Publication:1196187
DOI10.1007/BF01580907zbMath0762.90071MaRDI QIDQ1196187
Publication date: 17 December 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
multiextremal optimizationnecessary and sufficient convergence conditionsadaptive partition strategies
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (17)
The robust constant and its applications in random global search for unconstrained global optimization ⋮ A cover partitioning method for bound constrained 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 ⋮ On the convergence of adaptive partition algorithms in global optimization ⋮ One side cut accelerated random search ⋮ A global minimization algorithm for Lipschitz functions ⋮ Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms ⋮ TRIOPT: A triangulation-based partitioning algorithm for global optimization ⋮ \textsc{Oscars}-II: an algorithm for bound constrained global optimization ⋮ On convergence of "divide the best" global optimization algorithms ⋮ Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms ⋮ Experiments with new stochastic global optimization search techniques ⋮ A two phase local global search algorithm using new global search strategy ⋮ Global one-dimensional optimization using smooth auxiliary functions ⋮ Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving nonlinear equation systems via global partition and search: Some experimental results
- On the global minimization of concave functions
- Set partition by globally optimized cluster seed points
- Globally optimized calibration of environmental models
- Extended univariate algorithms for \(n\)-dimensional global optimization
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- On the convergence of global methods in multiextremal optimization
- An interval version of Shubert's iterative method for the localization of the global maximum
- Global optimization on convex sets
- An algorithm for global optimization of Lipschitz continuous functions
- Precision, complexity, and computational schemes of the cubic algorithms
- Constrained global optimization: algorithms and applications
- Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions
- A probabilistic algorithm for global optimization
- Global optimization using interval analysis - the multi-dimensional case
- On the convergence of two branch-and-bound algorithms for nonconvex programming problems
- An analytical approach to global optimization
- Global optimization of univariate Lipschitz functions. I: Survey and properties
- An application of Lipschitzian global optimization to product design
- Global optimization using interval analysis: The one-dimensional case
- On a sequential search strategy in global optimization problems
- A stochastic method for global optimization
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Convergence properties of stochastic optimization procedures
- Inclusion functions and global optimization
- Optimal Search for the Global Maximum of Functions with Bounded Seminorm
- Globally convergent methods for n-dimensional multiextremal optimization
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Stochastic global optimization methods part I: Clustering methods
- Stochastic global optimization methods part II: Multi level methods
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- A note on the convergence of an algorithm for nonconvex programming problems
- A method for globally minimizing concave functions over convex sets
- Two algorithms for one-dimensional multimodai minimization
- Convergent Algorithms for Minimizing a Concave Function
- Axiomatic approach to statistical models and their use in multimodal optimization theory
- Iterative Methods for the Localization of the Global Maximum
- Minimization by Random Search Techniques
- An algorithm for nonconvex programming problems
- Progressive global random search of continuous functions
- An algorithm for finding the absolute extremum of a function
- An Algorithm for Separable Nonconvex Programming Problems
- A Sequential Method Seeking the Global Maximum of a Function
- Estimation of the efficiency of an absolute-minimum-finding algorithm
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
This page was built for publication: Convergence qualification of adaptive partition algorithms in global optimization
