Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
type: Item
instance of: scholarly article
title: Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
zbMATH Open document ID: 0651.90063
DOI: 10.1007/BF01580762
author: Hoang Tuy
author: Reiner Horst
published in: Mathematical Programming. Series A. Series B
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49M37
zbMATH DE Number: 4062831
zbMATH Keywords: restart procedure
zbMATH Keywords: d.c. optimization.
zbMATH Keywords: branch-and-bound
zbMATH Keywords: global optimization
zbMATH Keywords: grid-search techniques
zbMATH Keywords: outer approximation
zbMATH Keywords: concave minimization
zbMATH Keywords: difference of two convex functions
MaRDI profile type: Publication
cites work: A Successive Underestimation Method for Concave Minimization Problems
cites work: An Algorithm for Separable Nonconvex Programming Problems
cites work: The cubic algorithm
cites work: Reverse convex programming
cites work: Linear programs with an additional reverse convex constraint
cites work: A method for globally minimizing concave functions over convex sets
cites work: An algorithm for nonconvex programming problems
cites work: A note on the convergence of an algorithm for nonconvex programming problems
cites work: On the global minimization of concave functions
cites work: A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
cites work: Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
cites work: Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
cites work: On the convergence of global methods in multiextremal optimization
cites work: Outer approximation algorithm for nondifferentiable optimization problems
cites work: Constrained global optimization: algorithms and applications
cites work: Globally convergent methods for n-dimensional multiextremal optimization
cites work: Convex Analysis
cites work: Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
cites work: Q3908420
cites work: Global optimization under Lipschitzian constraints
cites work: Convergent Algorithms for Minimizing a Concave Function
cites work: An outer approximation method for globally minimizing a concave function over a compact convex set
cites work: Q3686446
cites work: On outer approximation methods for solving concave minimization problems
cites work: Convex programs with an additional reverse convex constraint
cites work: A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
full work available at URL: https://doi.org/10.1007/bf01580762
OpenAlex ID: W1986778884
Recommended article: A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
Recommended article: A globally convergent algorithm for nonlinearly constrained optimization problems
Recommended article: On convergence of a global search strategy for reverse convex problems
Recommended article: A branch and bound-outer approximation algorithm for concave minimization over a convex set
Recommended article: Q4471050
Recommended article: On the convergence of global methods in multiextremal optimization
Recommended article: A branch and bound algorithm for globally solving a class of nonconvex programming problems
Recommended article: Convexification and concavification methods for some global optimization problems
Recommended article: Convergence-order analysis of branch-and-bound algorithms for constrained problems
Recommended article: Q4248748
description: scientific article; zbMATH DE number 4062831