scientific article
From MaRDI portal
Publication:3549617
zbMath1232.68177MaRDI QIDQ3549617
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
efficiencyprimal-dual approachinterior point methodssemidefinite programscombinatorial approximation algorithms
Analysis of algorithms (68W40) Multi-objective and goal programming (90C29) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (19)
Quantum machine learning: a classical perspective ⋮ Finding Sparse Solutions for Packing and Covering Semidefinite Programs ⋮ A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs ⋮ Geometric distinguishability measures limit quantum channel estimation and discrimination ⋮ Online variance minimization ⋮ Near-optimal discrete optimization for experimental design: a regret minimization approach ⋮ An SDP primal-dual algorithm for approximating the Lovász-theta function ⋮ Partitioning Well-Clustered Graphs: Spectral Clustering Works! ⋮ Near-Optimal Algorithms for Online Matrix Prediction ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Correlation clustering in data streams ⋮ Efficient semidefinite branch-and-cut for MAP-MRF inference ⋮ Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs ⋮ On randomized fictitious play for approximating saddle points over convex sets ⋮ Approximating small balanced vertex separators in almost linear time ⋮ Subsampling Algorithms for Semidefinite Programming ⋮ On Solving Large-Scale Polynomial Convex Problems by Randomized First-Order Algorithms ⋮ A quantum interior-point predictor–corrector algorithm for linear programming
This page was built for publication:
