A relaxation method for nonconvex quadratically constrained quadratic programs

DOI10.1007/BF01099462zbMath0835.90060OpenAlexW1968511016MaRDI QIDQ1892602

Faiz A. Al-Khayyal, Christian Larsen, Tim Van Voorhis

Publication date: 19 June 1995

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01099462

zbMATH Keywords

quadratically constrained quadratic programmingbranch-and-boundouter approximationapproximate global solutionslinear programming subproblemsrelaxation linearization technique

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (35)

Packing equal circles in a square: A deterministic global optimization approach ⋮ An accelerating algorithm for globally solving nonconvex quadratic programming ⋮ An optimal trade-off model for portfolio selection with sensitivity of parameters ⋮ Exact quadratic convex reformulations of mixed-integer quadratically constrained problems ⋮ Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective ⋮ Utility function programs and optimization over the efficient set in multiple-objective decision making ⋮ A robust algorithm for quadratic optimization under quadratic constraints ⋮ A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity ⋮ A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming ⋮ Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation ⋮ Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations ⋮ Multi-period price promotions in a single-supplier, multi-retailer supply chain under asymmetric demand information ⋮ A novel optimization method for nonconvex quadratically constrained quadratic programs ⋮ A distributed continuous-time method for non-convex QCQPs ⋮ Portfolio selection with the effect of systematic risk diversification: formulation and accelerated gradient algorithm ⋮ Inventory and investment in setup and quality operations under return on investment maximization ⋮ A class of differential quadratic programming problems ⋮ A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems ⋮ Global optimization algorithm for mixed integer quadratically constrained quadratic program ⋮ Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint ⋮ A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation ⋮ Duality bound method for the general quadratic programming problem with quadratic constraints ⋮ A global supply chain model with transfer pricing and transportation cost allocation ⋮ Lagrangian decomposition of block-separable mixed-integer all-quadratic programs ⋮ On solving nonconvex optimization problems by reducing the duality gap ⋮ The exact solution of multiparametric quadratically constrained quadratic programming problems ⋮ Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons ⋮ A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs ⋮ Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization ⋮ Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems ⋮ Difference of convex solution of quadratically constrained optimization problems. ⋮ Optimal trade-off portfolio selection between total risk and maximum relative marginal risk^† ⋮ An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs ⋮ Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D ⋮ Active allocation of systematic risk and control of risk sensitivity in portfolio optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Jointly constrained bilinear programs and related problems: An overview
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
• Bilinear programming and structured stochastic games
• Constrained global optimization: algorithms and applications
• Dual quadratic estimates in polynomial and Boolean programming
• Reduction of indefinite quadratic programs to bilinear programs
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• Generalized bilinear programming. I: Models, applications and linear programming relaxation
• New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
• Primal-relaxed dual global optimization approach
• Global optimization of a quadratic function subject to a bounded mixed integer constraint set
• An algorithm for indefinite integer quadratic programming
• Jointly Constrained Biconvex Programming
• Methods of Nonlinear 0-1 Programming
• Quadratically constrained quadratic programming: Some applications and a method for solution
• A Decomposition Strategy for Global Optimum Search in the Pooling Problem
• A bilinear approach to the pooling problem†
• Programming with a Quadratic Constraint
• Quadratic programming with quadratic constraints
• Modular Design—A Special Case in Nonlinear Programming

This page was built for publication: A relaxation method for nonconvex quadratically constrained quadratic programs