Global Minimization in Nonconvex All-Quadratic Programming
From MaRDI portal
Publication:4077088
DOI10.1287/mnsc.22.1.76zbMath0315.90059OpenAlexW2124774160MaRDI QIDQ4077088
Publication date: 1975
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.22.1.76
Related Items (8)
Solving highly nonlinear convex separable programs using successive approximation ⋮ Selected applications of all-quadratic programming ⋮ Algorithms for parametric nonconvex programming ⋮ Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming ⋮ Reduction of indefinite quadratic programs to bilinear programs ⋮ Generalized bilinear programming. I: Models, applications and linear programming relaxation ⋮ Separable concave minimization via partial outer approximation and branch and bound ⋮ AUGMENTED LAGRANGEAN RELAXATIONS IN GENERAL MIXED INTEGER PROGRAMMING
This page was built for publication: Global Minimization in Nonconvex All-Quadratic Programming