An algorithm for indefinite quadratic programming with convex constraints

DOI10.1016/0167-6377(91)90004-9MaRDI QIDQ1180839zbMATH OpenOpenAlexFDO

Authors Le Dung Muu, Werner Oettli

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

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

Recommendations

• An algorithm for indefinite integer quadratic programming
• A new branch-and-bound algorithm for indefinite quadratic programming problems
• A new branch and bound algorithm for indefinite integer quadratic programs
• scientific article; zbMATH DE number 1795733
• Branch-and-bound method for the minimization problem for a nonconvex quadratic function under convex quadratic constraints

Cites work

• scientific article; zbMATH DE number 3459377 (Why is no real title available?)
• An algorithm for nonconvex programming problems
• Constrained global optimization: algorithms and applications
• Jointly Constrained Biconvex Programming
• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization

Cited in

(17)

• Branch-and-bound method for the minimization problem for a nonconvex quadratic function under convex quadratic constraints
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• 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
• Method for minimizing a convex-concave function over a convex set
• A new algorithm for solving the general quadratic programming problem
• A global optimization algorithm using linear relaxation
• An algorithm for indefinite integer quadratic programming
• An unconstrained convex programming approach to solving convex quadratic programming problems
• An Algorithm for Unconstrained Quadratically Penalized Convex Optimization
• A derivative algorithm for inexact quadratic program -- application to environmental decision-making under uncertainty
• A computational comparison of some branch and bound methods for indefinite quadratic programs
• Decomposition methods for solving nonconvex quadratic programs via branch and bound
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• scientific article; zbMATH DE number 1795733 (Why is no real title available?)
• An algorithm for quadratic optimization with one quadratic constraint and bounds on the variables
• MINQ8: general definite and bound constrained indefinite quadratic programming

This page was built for publication: An algorithm for indefinite quadratic programming with convex constraints

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