Global Minimization in Nonconvex All-Quadratic Programming

DOI10.1287/MNSC.22.1.76MaRDI QIDQ4077088zbMATH OpenOpenAlexFDO

Authors Gary R. Reeves

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4077088)