A parallel algorithm for constrained concave quadratic global minimization
From MaRDI portal
Publication:1116888
DOI10.1007/BF01589415zbMath0665.90071MaRDI QIDQ1116888
Publication date: 1988
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
global minimizationComputational resultsparallel branch and boundbounded polyhedral setlarge-scale concave quadratic problems
Related Items (16)
Bilinear modeling solution approach for fixed charge network flow problems ⋮ Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions ⋮ A parallel algorithm for constrained concave quadratic global minimization ⋮ Convex and concave relaxations of implicit functions ⋮ A new bound-and-reduce approach of nonconvex quadratic programming problems ⋮ A computational analysis of LCP methods for bilinear and concave quadratic programming ⋮ Sufficient conditions for solving linearly constrained separable concave global minimization problems ⋮ A continuous approch for globally solving linearly constrained quadratic ⋮ A parallel algorithm for partially separable non-convex global minimization: Linear constraints ⋮ Minimum concave-cost network flow problems: Applications, complexity, and algorithms ⋮ Sharp bounds for the maximum of the chi-square index in a class of contingency tables with given marginals ⋮ A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems ⋮ New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints ⋮ A new technique for generating quadratic programming test problems ⋮ Global minimum potential energy conformations of small molecules ⋮ A quadratic assignment formulation of the molecular conformation problem
Cites Work
- Unnamed Item
- Constrained global optimization: algorithms and applications
- A parallel algorithm for constrained concave quadratic global minimization
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Methods for Global Concave Minimization: A Bibliographic Survey
- Anomalous Acceleration in Parallel Multiple-Cost-Row Linear Programming
- An algorithm for nonconvex programming problems
- A Successive Underestimation Method for Concave Minimization Problems
This page was built for publication: A parallel algorithm for constrained concave quadratic global minimization