Work

Approximating SDP solutions with linear programs and simplex-like algorithm

Year: 2022
Type: conference-paper
Abstract: we present an algorithm to compute upper bounds to semidefinite programs thanks to a hierarchy of linear programs. At each iteration, we find an optimal basis for the next iteration as it is the case in the simplex algorithm for the linear case
Source: HAL
Language: French
Open Access status: green
OpenAlex ID: W4292575415
FWCI:
Cites:
Cited by:
Related to: 10