The spherical constraint in Boolean quadratic programs
type: Item
instance of: scholarly article
title: The spherical constraint in Boolean quadratic programs
zbMATH Open document ID: 1146.90043
author: Jérôme Malick
published in: Journal of Global Optimization
publication date: 2008-06-03T00:00:00Z
full work available at URL: 07-malick.pdf
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 5281932
zbMATH Keywords: SDP relaxation
zbMATH Keywords: Combinatorial optimization
zbMATH Keywords: Lagrangian duality
zbMATH Keywords: Convex analysis
describes a project that uses: Scilab
describes a project that uses: SDPLR
describes a project that uses: QSDP
MaRDI profile type: Publication
OpenAlex ID: W2014548643
cites work: Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
cites work: Convex analysis and nonlinear optimization. Theory and examples
cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
cites work: Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
cites work: Q3134873
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Solving the \(p\)-median problem with a semi-Lagrangian relaxation
cites work: Q4085497
cites work: Q4226179
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Computing the nearest correlation matrix--a problem from finance
cites work: Lower bound improvement and forcing rule for quadratic binary programming
cites work: Introduction to global optimization.
cites work: A Spectral Bundle Method for Semidefinite Programming
cites work: Q2753173
cites work: Semidefinite Programming vs. LP Relaxations for Polynomial Programming
cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
cites work: Q4735938
cites work: SDP relaxations in combinatorial optimization from a Lagrangian viewpoint.
cites work: On the Shannon capacity of a graph
cites work: A Dual Approach to Semidefinite Least-Squares Problems
cites work: Iterative Solution of Linear Programs
cites work: An Implicit Enumeration Algorithm for Quadratic Integer Programming
cites work: Q4517108
cites work: Seizure warning algorithm based on optimization and nonlinear dynamics
cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
cites work: A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
cites work: A nonlinear equation for linear programming
DOI: 10.1007/S10898-007-9161-1
description: scientific article; zbMATH DE number 5281932