On the convergence of two branch-and-bound algorithms for nonconvex programming problems
From MaRDI portal
Publication:1149236
DOI10.1007/BF00934342zbMath0453.65046OpenAlexW2057620612MaRDI QIDQ1149236
Publication date: 1982
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00934342
Related Items
Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, Deletion-by-infeasibility rule for DC-constrained global optimization, On solving general reverse convex programming problems by a sequence of linear programs and line searches, Inclusion functions and global optimization. II, On the selection of subdivision directions in interval branch-and-bound methods for global optimization, Algorithms for parametric nonconvex programming, Method for minimizing a convex-concave function over a convex set, An all-linear programming relaxation algorithm for optimizing over the efficient set, Convergence qualification of adaptive partition algorithms in global optimization, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, Calculation of bounds on variables satisfying nonlinear inequality constraints, Separable concave minimization via partial outer approximation and branch and bound, A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization, Global optimization algorithms for linearly constrained indefinite quadratic problems, Concave minimization via conical partitions and polyhedral outer approximation, A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
Cites Work
