On the public citation graph

A Combinatorial, Primal-Dual Approach to Semidefinite Programs

0 signed · 111 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11776420_38openalex-snapshot
Online Variance Minimization
inferredcites →https://doi.org/10.1007/s10107-004-0553-4openalex-snapshot
Non-euclidean restricted memory level method for large-scale convex optimization
inferredcites →https://doi.org/10.1016/0378-4754(84)90101-0openalex-snapshot
Problem complexity and method efficiency in optimization
inferredcites →https://doi.org/10.1016/s0022-0000(03)00025-4openalex-snapshot
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
inferredcites →https://doi.org/10.1016/s0167-6377(02)00231-6openalex-snapshot
Mirror descent and nonlinear projected subgradient methods for convex optimization
inferredcites →https://doi.org/10.1017/cbo9780511804441openalex-snapshot
Convex Optimization
inferredcites →https://doi.org/10.1063/1.1704727openalex-snapshot
Inequality with Applications in Statistical Mechanics
inferredcites →https://doi.org/10.1098/rspa.2007.0113openalex-snapshot
The learnability of quantum states
inferredcites →https://doi.org/10.1103/physrev.137.b1127openalex-snapshot
Lower Bounds for the Helmholtz Function
inferredcites →https://doi.org/10.1109/18.985947openalex-snapshot
Strong converse for identification via quantum channels
inferredcites →https://doi.org/10.1109/focs.2009.66openalex-snapshot
Breaking the multicommodity flow barrier for o(√log n)-approximations to sparsest cut
inferredcites →https://doi.org/10.1109/focs.2013.36openalex-snapshot
Nearly Maximum Flows in Nearly Linear Time
inferredcites →https://doi.org/10.1109/sfcs.1991.185411openalex-snapshot
Fast approximation algorithms for fractional packing and covering problems
inferredcites →https://doi.org/10.1109/sfcs.1998.743463openalex-snapshot
Faster and simpler algorithms for multicommodity flow and other fractional packing problems
inferredcites →https://doi.org/10.1109/sfcs.2005.35openalex-snapshot
Fast algorithms for approximate semidefinite programming using the multiplicative weights update method
inferredcites →https://doi.org/10.1109/sfcs.2005.8openalex-snapshot
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications
inferredcites →https://doi.org/10.1137/0805002openalex-snapshot
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
inferredcites →https://doi.org/10.1137/080731049openalex-snapshot
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
inferredcites →https://doi.org/10.1137/1.9780898716474openalex-snapshot
Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/1020098openalex-snapshot
Nineteen Dubious Ways to Compute the Exponential of a Matrix
inferredcites →https://doi.org/10.1137/s0895480199355754openalex-snapshot
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
inferredcites →https://doi.org/10.1145/1007352.1007355openalex-snapshot
Expander flows, geometric embeddings and graph partitioning
inferredcites →https://doi.org/10.1145/103418.103437openalex-snapshot
When trees collide
inferredcites →https://doi.org/10.1145/1060590.1060675openalex-snapshot
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
inferredcites →https://doi.org/10.1145/1132516.1132574openalex-snapshot
Graph partitioning using single commodity flows
inferredcites →https://doi.org/10.1145/1250790.1250823openalex-snapshot
A combinatorial, primal-dual approach to semidefinite programs
inferredcites →https://doi.org/10.1145/1374376.1374442openalex-snapshot
On partitioning graphs via single commodity flows
inferredcites →https://doi.org/10.1145/1536414.1536452openalex-snapshot
Max cut and the smallest eigenvalue
inferredcites →https://doi.org/10.1145/2049697.2049704openalex-snapshot
QIP = PSPACE
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.1145/237814.237827openalex-snapshot
Approximating s-t minimum cuts in Õ ( n 2 ) time
inferredcites →https://doi.org/10.1145/237814.237980openalex-snapshot
Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING
inferredcites →https://doi.org/10.1145/285861.285868openalex-snapshot
Expokit
inferredcites →https://doi.org/10.1145/290179.290181openalex-snapshot
Beyond the flow decomposition barrier
inferredcites →https://doi.org/10.1145/301250.301257openalex-snapshot
A constant-factor approximation algorithm for the k -median problem (extended abstract)
inferredcites →https://doi.org/10.1145/331605.331608openalex-snapshot
Minimum cuts in near-linear time
inferredcites →https://doi.org/10.1145/375827.375845openalex-snapshot
Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
inferredcites →https://doi.org/10.1287/moor.20.2.257openalex-snapshot
Fast Approximation Algorithms for Fractional Packing and Covering Problems
inferredcites →https://doi.org/10.4086/toc.2008.v004a003openalex-snapshot
inferredcites →https://doi.org/10.4086/toc.2012.v008a006openalex-snapshot
inferredcites →https://doi.org/10.5555/1046920.1088706openalex-snapshot
Matrix Exponentiated Gradient Updates for On-line Learning and Bregman Projection
inferredcites →https://doi.org/10.5555/1070432.1070446openalex-snapshot
On distance scales, embeddings, and efficient relaxations of the cut cone
inferredcites →https://doi.org/10.5555/2634074.2634090openalex-snapshot
An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-032-28691-8_7openalex-snapshot
O(log n)-Approximation Algorithms for Bipartiteness Ratio
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_57openalex-snapshot
SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_16openalex-snapshot
Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_16openalex-snapshot
Approximationsalgorithmen
inferred← citeshttps://doi.org/10.1007/978-981-16-4095-7_4openalex-snapshot
Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs
inferred← citeshttps://doi.org/10.1007/s11128-024-04256-6openalex-snapshot
A quantum online portfolio optimization algorithm
inferred← citeshttps://doi.org/10.1017/9781108699211openalex-snapshot
Algorithms for Convex Optimization
inferred← citeshttps://doi.org/10.1017/9781108699211.001openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1017/9781108699211.002openalex-snapshot
Notation
inferred← citeshttps://doi.org/10.1017/9781108699211.003openalex-snapshot
Bridging Continuous and Discrete Optimization
inferred← citeshttps://doi.org/10.1017/9781108699211.004openalex-snapshot
Preliminaries
inferred← citeshttps://doi.org/10.1017/9781108699211.005openalex-snapshot
Convexity
inferred← citeshttps://doi.org/10.1017/9781108699211.006openalex-snapshot
Convex Optimization and Efficiency
inferred← citeshttps://doi.org/10.1017/9781108699211.007openalex-snapshot
Duality and Optimality
inferred← citeshttps://doi.org/10.1017/9781108699211.008openalex-snapshot
Gradient Descent
inferred← citeshttps://doi.org/10.1017/9781108699211.009openalex-snapshot
Mirror Descent and the MultiplicativeWeights Update
inferred← citeshttps://doi.org/10.1017/9781108699211.010openalex-snapshot
Accelerated Gradient Descent
inferred← citeshttps://doi.org/10.1017/9781108699211.011openalex-snapshot
Newton’s Method
inferred← citeshttps://doi.org/10.1017/9781108699211.012openalex-snapshot
An Interior Point Method for Linear Programming
inferred← citeshttps://doi.org/10.1017/9781108699211.013openalex-snapshot
Variants of Interior Point Method and Self-Concordance
inferred← citeshttps://doi.org/10.1017/9781108699211.014openalex-snapshot
Ellipsoid Method for Linear Programming
inferred← citeshttps://doi.org/10.1017/9781108699211.015openalex-snapshot
Ellipsoid Method for Convex Optimization
inferred← citeshttps://doi.org/10.1017/9781108699211.016openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/9781108699211.017openalex-snapshot
Index
inferred← citeshttps://doi.org/10.1038/s42254-023-00603-1openalex-snapshot
Quantum computing for finance
inferred← citeshttps://doi.org/10.1088/1742-5468/ab3988openalex-snapshot
Online learning of quantum states*
inferred← citeshttps://doi.org/10.1103/physreva.103.012418openalex-snapshot
Quantum algorithms for hedging and the learning of Ising models
inferred← citeshttps://doi.org/10.1109/focs.2017.44openalex-snapshot
Quantum SDP-Solvers: Better Upper and Lower Bounds
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00022openalex-snapshot
List Decodable Mean Estimation in Nearly Linear Time
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00065openalex-snapshot
Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00021openalex-snapshot
Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal Binary Codes
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00082openalex-snapshot
stateQIP = statePSPACE
inferred← citeshttps://doi.org/10.1109/icrc64395.2024.10937015openalex-snapshot
Thermodynamic Algorithms for Quadratic Programming
inferred← citeshttps://doi.org/10.1109/nano58406.2023.10231307openalex-snapshot
Simulated Oscillator-Based Ising Machine for two Million Nodes Max-Cut Problems
inferred← citeshttps://doi.org/10.1126/sciadv.adl3237openalex-snapshot
Many photonic design problems are sparse QCQPs
inferred← citeshttps://doi.org/10.1137/19m1305045openalex-snapshot
Scalable Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/20m137570xopenalex-snapshot
Finding Sparse Solutions for Packing and Covering Semidefinite Programs
inferred← citeshttps://doi.org/10.1137/21m1391018openalex-snapshot
Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
inferred← citeshttps://doi.org/10.1145/3313276.3316320openalex-snapshot
A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems
inferred← citeshttps://doi.org/10.1145/3313276.3316366openalex-snapshot
Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
inferred← citeshttps://doi.org/10.1145/3357713.3384314openalex-snapshot
Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing Quantum machine learning
inferred← citeshttps://doi.org/10.1145/3406325.3451056openalex-snapshot
A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path
inferred← citeshttps://doi.org/10.1145/3549524openalex-snapshot
Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning
inferred← citeshttps://doi.org/10.1145/3626183.3659969openalex-snapshot
A Simpler and Parallelizable O(√log n)-approximation Algorithm for Sparsest Cut
inferred← citeshttps://doi.org/10.1145/3717823.3718212openalex-snapshot
Redundancy Is All You Need
inferred← citeshttps://doi.org/10.1145/3748723openalex-snapshot
A Simpler and Parallelizable \(\boldsymbol{O(\sqrt{\log n})}\) -Approximation Algorithm for Sparsest Cut
inferred← citeshttps://doi.org/10.1145/3798129.3800763openalex-snapshot
Derandomizing Matrix Concentration Inequalities from Free Probability
inferred← citeshttps://doi.org/10.1214/19-aos1843openalex-snapshot
Mean estimation with sub-Gaussian rates in polynomial time
inferred← citeshttps://doi.org/10.1287/moor.2014.0681openalex-snapshot
On Solving Large-Scale Polynomial Convex Problems by Randomized First-Order Algorithms
inferred← citeshttps://doi.org/10.1287/opre.2022.2341openalex-snapshot
Fast Quantum Subroutines for the Simplex Method
inferred← citeshttps://doi.org/10.22331/q-2020-02-14-230openalex-snapshot
Quantum SDP-Solvers: Better upper and lower bounds
inferred← citeshttps://doi.org/10.22331/q-2022-01-20-625openalex-snapshot
Faster quantum and classical SDP approximations for quadratic binary optimization
inferred← citeshttps://doi.org/10.22331/q-2023-07-12-1057openalex-snapshot
Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints
inferred← citeshttps://doi.org/10.22331/q-2024-06-17-1374openalex-snapshot
Variational Quantum Algorithms for Semidefinite Programming
inferred← citeshttps://doi.org/10.22331/q-2025-01-15-1594openalex-snapshot
Recursive Quantum Relaxation for Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.26421/qic19.15-16-5openalex-snapshot
Quantum and classical algorithms for approximate submodular function minimization
inferred← citeshttps://doi.org/10.3390/a13110295openalex-snapshot
Spectrum-Adapted Polynomial Approximation for Matrix Functions with Applications in Graph Signal Processing
inferred← citeshttps://doi.org/10.3934/fods.2024034openalex-snapshot
Graph Matching via convex relaxation to the simplex
inferred← citeshttps://doi.org/10.4230/lipics.esa.2020.70openalex-snapshot
Augmenting the Algebraic Connectivity of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1802.09025openalex-snapshot
Online Learning of Quantum States
inferred← citeshttps://doi.org/10.48550/arxiv.1806.08838openalex-snapshot
Bayesian Optimization of Combinatorial Structures
inferred← citeshttps://doi.org/10.48550/arxiv.1906.04661openalex-snapshot
Faster Algorithms for High-Dimensional Robust Covariance Estimation
inferred← citeshttps://doi.org/10.48550/arxiv.1907.05378openalex-snapshot
Quantum and Classical Algorithms for Approximate Submodular Function Minimization
inferred← citeshttps://doi.org/10.48550/arxiv.1910.07950openalex-snapshot
Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex
inferred← citeshttps://doi.org/10.48550/arxiv.2010.11645openalex-snapshot
Enabling certification of verification-agnostic networks via memory-efficient semidefinite programming
inferred← citeshttps://doi.org/10.48550/arxiv.2011.05365openalex-snapshot
A Nearly-Linear Time Algorithm for Linear Programs with Small Treewidth: A Multiscale Representation of Robust Central Path
inferred← citeshttps://doi.org/10.70675/43dbb94ez355ez42d2za9e8z47c1e9983ab9openalex-snapshot
Quantum algorithms for the Monte Carlo method
inferred← citeshttps://doi.org/10.70675/f0d70a66z3066z4c81z8aa7zf9e72830f940openalex-snapshot
Quantum algorithms for energy management optimization problems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.