Global minimization of large-scale constrained concave quadratic problems by separable programming
From MaRDI portal
Publication:3731373
DOI10.1007/BF01580581zbMath0597.90066MaRDI QIDQ3731373
Panos M. Pardalos, J. Ben Rosen
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
separable programming; \(\epsilon \) -optimal solutions; concave quadratic minimization; eigenvalue-eigenvector- decomposition; large-scale linearly constrained concave quadratic problem
Related Items
Duality bound method for the general quadratic programming problem with quadratic constraints, A generalized duality and applications, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, Global optimization algorithms for linearly constrained indefinite quadratic problems, Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications, Decomposition methods for solving nonconvex quadratic programs via branch and bound, Jointly constrained bilinear programs and related problems: An overview, An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds, A computational comparison of some branch and bound methods for indefinite quadratic programs, Global minimization of indefinite quadratic problems, Enumerative techniques for solving some nonconvex global optimization problems, Parallel search algorithms in global optimization, A parallel algorithm for constrained concave quadratic global minimization, Method for minimizing a convex-concave function over a convex set, Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming, On nonconvex optimization problems with separated nonconvex variables, Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems, An algorithm for a class of nonlinear fractional problems using ranking of the vertices, An interval branch and bound algorithm for global optimization of a multiperiod pricing model, An algorithm for maximizing a convex function over a simple set, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, D.c sets, d.c. functions and nonlinear equations, A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems, A decomposition approach for global optimum search in QP, NLP and MINLP problems, An algorithm for indefinite integer quadratic programming, A continuous approch for globally solving linearly constrained quadratic, A variant of Tuy's decomposition algorithm for solving a class of concave minimization problems, A decomposition method for the min concave cost flow problem with a staircase structure, Reduction of nonlinear integer separable programming problems∗
Uses Software
Cites Work
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Construction of large-scale global minimum concave quadratic test problems
- The Quadratic Assignment Problem
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- Performance of approximate algorithms for global minimization
- Solving Large-Scale Zero-One Linear Programming Problems
- Methods for Global Concave Minimization: A Bibliographic Survey
- Convergent Algorithms for Minimizing a Concave Function
- On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
- A bilinear programming formulation of the 3-dimensional assignment problem
- An algorithm for nonconvex programming problems
- Maximization of A convex quadratic function under linear constraints
- A Successive Underestimation Method for Concave Minimization Problems
- Characterization of linear complementarity problems as linear programs
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
