Pages that link to "Item:Q1196187"
From MaRDI portal
The following pages link to Convergence qualification of adaptive partition algorithms in global optimization (Q1196187):
Displaying 24 items.
- The robust constant and its applications in random global search for unconstrained global optimization (Q280976) (← links)
- Global convergence revisited: Reply to A. Žilinskas (Q751774) (← links)
- Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms (Q995933) (← links)
- On the convergence of global methods in multiextremal optimization (Q1078082) (← links)
- Optimality tests for partitioning and sectional search algorithms (Q1178318) (← links)
- Global one-dimensional optimization using smooth auxiliary functions (Q1290603) (← links)
- On convergence conditions of partitioned solution procedures for consolidation problems (Q1309625) (← links)
- A multivariate partition approach to optimization problems (Q1406314) (← links)
- On the efficiency of a global non-differentiable optimization algorithm based on the method of optimal set partitioning (Q1411325) (← links)
- Experiments with new stochastic global optimization search techniques (Q1571032) (← links)
- Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization (Q1595195) (← links)
- On convergence rate of a rectangular partition based global optimization algorithm (Q1754460) (← links)
- TRIOPT: A triangulation-based partitioning algorithm for global optimization (Q1763759) (← links)
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization (Q1904648) (← links)
- An intelligent decision support system for assisting industrial wastewater management (Q1904735) (← links)
- An algorithm for solving global optimization problems with nonlinear constraints (Q1913609) (← links)
- \textsc{Oscars}-II: an algorithm for bound constrained global optimization (Q2022219) (← links)
- One side cut accelerated random search (Q2448186) (← links)
- A global minimization algorithm for Lipschitz functions (Q2465562) (← links)
- A cover partitioning method for bound constrained global optimization (Q2905347) (← links)
- A two phase local global search algorithm using new global search strategy (Q3411890) (← links)
- On the convergence of adaptive partition algorithms in global optimization (Q3496164) (← links)
- On convergence of "divide the best" global optimization algorithms (Q4944418) (← links)
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms (Q5925738) (← links)