Algorithm 875
From MaRDI portal
Publication:3549240
DOI10.1145/1356052.1356057zbMath1291.65173OpenAlexW2021640942WikidataQ113310615 ScholiaQ113310615MaRDI QIDQ3549240
Publication date: 21 December 2008
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1356052.1356057
Related Items (20)
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs ⋮ Conic mixed-integer rounding cuts ⋮ Finding graph embeddings by incremental low-rank semidefinite programming ⋮ Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods ⋮ Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones ⋮ Sampling Algebraic Varieties for Sum of Squares Programs ⋮ An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem ⋮ Matrix-Free Convex Optimization Modeling ⋮ A framework for solving mixed-integer semidefinite programs ⋮ Maximizing the algebraic connectivity of meshed electrical pathways used as current return network ⋮ A branch‐and‐price approach to k‐clustering minimum biclique completion problem ⋮ Optimal experiment design in a filtering context with application to sampled network data ⋮ Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons ⋮ Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems ⋮ Computational experience with a SDP-based algorithm for maximum cut with limited unbalance ⋮ The State-of-the-Art in Conic Optimization Software ⋮ On the Generation of Positivstellensatz Witnesses in Degenerate Cases ⋮ Bregman primal-dual first-order method and application to sparse semidefinite programming ⋮ An inexact dual logarithmic barrier method for solving sparse semidefinite programs ⋮ Low-rank exploitation in semidefinite programming for control
Uses Software
This page was built for publication: Algorithm 875
