An algorithm for indefinite quadratic programming with convex constraints

DOI10.1016/0167-6377(91)90004-9zbMath0748.90049OpenAlexW2029877367MaRDI QIDQ1180839

Werner Oettli, Le Dung Muu

Publication date: 27 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://ub-madoc.bib.uni-mannheim.de/1976/1/1989_89.pdf

zbMATH Keywords

branch-and-bound

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A reformulation-convexification approach for solving nonconvex quadratic programming problems, A new algorithm for solving the general quadratic programming problem, Method for minimizing a convex-concave function over a convex set, A computational comparison of some branch and bound methods for indefinite quadratic programs, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, An algorithm for solving convex programs with an additional convex- concave constraint, A global optimization algorithm using linear relaxation, Decomposition methods for solving nonconvex quadratic programs via branch and bound

Cites Work

• Unnamed Item
• Constrained global optimization: algorithms and applications
• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
• Jointly Constrained Biconvex Programming
• An algorithm for nonconvex programming problems