Global minimization of large-scale constrained concave quadratic problems by separable programming
From MaRDI portal
Publication:3731373
DOI10.1007/BF01580581zbMath0597.90066OpenAlexW2023054591MaRDI QIDQ3731373
Panos M. Pardalos, J. Ben Rosen
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580581
separable programming\(\epsilon \) -optimal solutionsconcave quadratic minimizationeigenvalue-eigenvector- decompositionlarge-scale linearly constrained concave quadratic problem
Related Items (53)
A hybrid LP/NLP paradigm for global optimization relaxations ⋮ D.c sets, d.c. functions and nonlinear equations ⋮ Global minimization of indefinite quadratic problems ⋮ An interval branch and bound algorithm for global optimization of a multiperiod pricing model ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ A decomposition approach for global optimum search in QP, NLP and MINLP problems ⋮ Enumerative techniques for solving some nonconvex global optimization problems ⋮ Computing tight bounds via piecewise linear functions through the example of circle cutting problems ⋮ On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming ⋮ An algorithm for indefinite integer quadratic programming ⋮ Piecewise linear bounding functions in univariate global optimization ⋮ A decomposition method for the min concave cost flow problem with a staircase structure ⋮ Parallel search algorithms in global optimization ⋮ A parallel algorithm for constrained concave quadratic global minimization ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ An algorithm for maximizing a convex function over a simple set ⋮ Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach ⋮ Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations ⋮ Data-driven fair resource allocation for novel emerging epidemics: a COVID-19 Convalescent Plasma case study ⋮ Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems ⋮ On zero duality gap in nonconvex quadratic programming problems ⋮ A new bound-and-reduce approach of nonconvex quadratic programming problems ⋮ Maximizing strictly convex quadratic functions with bounded perturbations ⋮ Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations ⋮ Jointly constrained bilinear programs and related problems: An overview ⋮ An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds ⋮ Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods ⋮ A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization ⋮ Method for minimizing a convex-concave function over a convex set ⋮ Reduction of nonlinear integer separable programming problems∗ ⋮ Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming ⋮ A computational comparison of some branch and bound methods for indefinite quadratic programs ⋮ On nonconvex optimization problems with separated nonconvex variables ⋮ A generalized duality and applications ⋮ Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems ⋮ Duality bound method for the general quadratic programming problem with quadratic constraints ⋮ Convergence and application of a decomposition method using duality bounds for nonconvex global optimization ⋮ Piecewise-linear approximations of multidimensional functions ⋮ A continuous approch for globally solving linearly constrained quadratic ⋮ Minimum concave-cost network flow problems: Applications, complexity, and algorithms ⋮ A variant of Tuy's decomposition algorithm for solving a class of concave minimization problems ⋮ Subdeterminants and Concave Integer Quadratic Programming ⋮ On approximation algorithms for concave mixed-integer quadratic programming ⋮ Piecewise Linear Function Fitting via Mixed-Integer Linear Programming ⋮ On the Derivation of Continuous Piecewise Linear Approximating Functions ⋮ An algorithm for a class of nonlinear fractional problems using ranking of the vertices ⋮ An effective linear approximation method for separable programming problems ⋮ A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems ⋮ Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\) ⋮ 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 ⋮ Conical algorithm for the global minimization of linearly constrained decomposable concave minimization 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
This page was built for publication: Global minimization of large-scale constrained concave quadratic problems by separable programming
