A relaxation method for nonconvex quadratically constrained quadratic programs
type: Item
instance of: scholarly article
title: A relaxation method for nonconvex quadratically constrained quadratic programs
zbMATH Open document ID: 0835.90060
DOI: 10.1007/BF01099462
author: Faiz Al-Khayyal
author: Christian Larsen
author: Tim Van Voorhis
published in: Journal of Global Optimization
publication date: 1995-06-19T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 765205
zbMATH Keywords: relaxation linearization technique
zbMATH Keywords: approximate global solutions
zbMATH Keywords: quadratically constrained quadratic programming
zbMATH Keywords: outer approximation
zbMATH Keywords: branch-and-bound
zbMATH Keywords: linear programming subproblems
MaRDI profile type: Publication
cites work: Jointly constrained bilinear programs and related problems: An overview
cites work: Generalized bilinear programming. I: Models, applications and linear programming relaxation
cites work: Jointly Constrained Biconvex Programming
cites work: Global optimization of a quadratic function subject to a bounded mixed integer constraint set
cites work: Q3987199
cites work: Quadratic programming with quadratic constraints
cites work: An algorithm for indefinite integer quadratic programming
cites work: Modular Design—A Special Case in Nonlinear Programming
cites work: Bilinear programming and structured stochastic games
cites work: A Decomposition Strategy for Global Optimum Search in the Pooling Problem
cites work: Primal-relaxed dual global optimization approach
cites work: A bilinear approach to the pooling problem†
cites work: Methods of Nonlinear 0-1 Programming
cites work: Reduction of indefinite quadratic programs to bilinear programs
cites work: Quadratically constrained quadratic programming: Some applications and a method for solution
cites work: A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
cites work: Q3997222
cites work: Constrained global optimization: algorithms and applications
cites work: Q3994364
cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
cites work: Dual quadratic estimates in polynomial and Boolean programming
cites work: Programming with a Quadratic Constraint
cites work: New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
full work available at URL: https://doi.org/10.1007/bf01099462
OpenAlex ID: W1968511016
description: scientific article; zbMATH DE number 765205