Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms

DOI10.1007/BF00120663zbMath0744.90083MaRDI QIDQ1177911

Hoang Tuy

Publication date: 26 June 1992

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

global optimizationconvergenceefficiencybranch-and-boundsubdivision strategiesweakly exhaustive simplicial subdivision

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (28)

A d.c. optimization method for single facility location problems ⋮ Linearization method for a class of multiplicative programming with exponent ⋮ Global optimization of generalized linear fractional programming with nonlinear constraints ⋮ A new rectangle branch-and-pruning approach for generalized geometric programming ⋮ A branch-and-reduce approach to global optimization ⋮ Global algorithm for a class of multiplicative programs using piecewise linear approximation technique ⋮ A new linearization method for generalized linear multiplicative programming ⋮ A global optimization using linear relaxation for generalized geometric programming ⋮ On geometry and convergence of a class of simplicial covers ⋮ Simplicially-constrained DC optimization over efficient and weakly efficient sets ⋮ On the exhaustivity of simplicial partitioning ⋮ Optimization over equilibrium sets^∗ ⋮ A global optimization algorithm for signomial geometric programming problem ⋮ Global optimization of signomial geometric programming using linear relaxation. ⋮ Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program ⋮ On solving a d.c. programming problem by a sequence of linear programs ⋮ A new simplicial cover technique in constrained global optimization ⋮ On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions ⋮ Minimizing the sum of a convex function and a specially structured nonconvex function ⋮ A global optimization approach for the linear two-level program ⋮ Linearization method of global optimization for generalized geometric programming ⋮ Outer approximation algorithms for canonical DC problems ⋮ A convergent conical algorithm with \(\omega \)-bisection for concave minimization ⋮ A global optimization algorithm using linear relaxation ⋮ Global optimization for sum of linear ratios problem using new pruning technique ⋮ Subdivision of simplices relative to a cutting plane and finite concave minimization ⋮ Numerical solution for optimization over the efficient set by d.c. optimization algorithms ⋮ A quasiconcave minimization method for solving linear two-level programs

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
• Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
• Normal conical algorithm for concave minimization over polytopes
• A class of exhaustive cone splitting procedures in conical algorithms for concave minmization
• An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
• Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex Polytopes
• Convergent Algorithms for Minimizing a Concave Function
• An algorithm for nonconvex programming problems
• Conical algorithms for solving a concave programming problem and some generalizations
• An Algorithm for Separable Nonconvex Programming Problems

This page was built for publication: Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms