A polyhedral approach for nonconvex quadratic programming problems with box constraints
type: Item
instance of: scholarly article
title: A polyhedral approach for nonconvex quadratic programming problems with box constraints
zbMATH Open document ID: 0912.90234
DOI: 10.1023/A:1008293029350
author: Yasutoshi Yajima
author: Tetsuya Fujie
published in: Journal of Global Optimization
publication date: 1998-12-02T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 1228823
zbMATH Keywords: valid inequalities
zbMATH Keywords: linearization
zbMATH Keywords: nonconvex quadratic problems
zbMATH Keywords: box constraints
zbMATH Keywords: cutting plane algorithms
zbMATH Keywords: heuristic
MaRDI profile type: MaRDI publication profile
full work available at URL: a:1008293029350
OpenAlex ID: W2165969805
Recommended article: Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
Recommended article: On nonconvex quadratic programming with box constraints
Recommended article: A polyhedral study of nonconvex quadratic programs with box constraints
Recommended article: Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
description: scientific article; zbMATH DE number 1228823