A linear programming reformulation of the standard quadratic optimization problem
type: Item
instance of: scholarly article
title: A linear programming reformulation of the standard quadratic optimization problem
zbMATH Open document ID: 1127.90051
author: E. de Klerk
author: Dmitrii V. Pasechnik
published in: Journal of Global Optimization
publication date: 2007-03-06T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C08
zbMATH DE Number: 5131214
zbMATH Keywords: Linear programming
zbMATH Keywords: Standard quadratic optimization
zbMATH Keywords: Positive polynomials
MaRDI profile type: Publication
full work available at URL: s10898-006-9037-9
OpenAlex ID: W2163155064
Wikidata QID: Q56874369
cites work: Regularity versus Degeneracy in Dynamics, Games, and Optimization: A Unified Approach to Different Aspects
cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
cites work: Linear inequalities and quadratic forms
cites work: On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
cites work: A PTAS for the minimization of polynomials of fixed degree over the simplex
cites work: Improved Bounds for the Crossing Numbers of Km,n and Kn
cites work: Approximation of the stability number of a graph via copositive programming
cites work: An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
cites work: Semidefinite Programming vs. LP Relaxations for Polynomial Programming
cites work: Polynomial Programming: LP-Relaxations Also Converge
cites work: Semidefinite representations for finite varieties
cites work: Maxima for Graphs and a New Proof of a Theorem of Turán
cites work: A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
cites work: LMI Approximations for Cones of Positive Semidefinite Forms
DOI: 10.1007/S10898-006-9037-9
description: scientific article; zbMATH DE number 5131214