On the public citation graph
Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard
0 signed · 34 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcom.1995.1005openalex-snapshot
On the Complexity of Approximating Extremal Determinants in Matrices
inferredcites →https://doi.org/10.1007/bf01580074openalex-snapshot
A modified layered-step interior-point algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf02592148openalex-snapshot
A primal-dual interior point method whose running time depends only on the constraint matrix
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-031-06901-7_11openalex-snapshot
On Circuit Diameter Bounds via Circuit Imbalances
inferred← citeshttps://doi.org/10.1007/978-3-031-59835-7_5openalex-snapshot
A First Order Method for Linear Programming Parameterized by Circuit Imbalance
inferred← citeshttps://doi.org/10.1007/s10107-007-0141-5openalex-snapshot
A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms
inferred← citeshttps://doi.org/10.1007/s10107-023-01956-2openalex-snapshot
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
inferred← citeshttps://doi.org/10.1007/s10107-024-02107-xopenalex-snapshot
On circuit diameter bounds via circuit imbalances
inferred← citeshttps://doi.org/10.1007/s10107-025-02264-7openalex-snapshot
A first order method for linear programming parameterized by circuit imbalance
inferred← citeshttps://doi.org/10.1017/9781009093927.004openalex-snapshot
Circuit Imbalance Measures and Linear Programming
inferred← citeshttps://doi.org/10.1051/ro:2006023openalex-snapshot
On semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ball
inferred← citeshttps://doi.org/10.1080/02331930600662906openalex-snapshot
Extreme points of well-posed polytopes
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00091openalex-snapshot
Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers
inferred← citeshttps://doi.org/10.1137/030602228openalex-snapshot
Error Estimates in the Optimization of Degree Two Polynomials on a Discrete Hypercube
inferred← citeshttps://doi.org/10.1137/04061341xopenalex-snapshot
Complex Quadratic Optimization and Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/050642691openalex-snapshot
Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
inferred← citeshttps://doi.org/10.1137/070679041openalex-snapshot
Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
inferred← citeshttps://doi.org/10.1137/070693461openalex-snapshot
A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming
inferred← citeshttps://doi.org/10.1137/1.9781611977073openalex-snapshot
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferred← citeshttps://doi.org/10.1137/1.9781611977073.106openalex-snapshot
On finding exact solutions of linear programs in the oracle model
inferred← citeshttps://doi.org/10.1137/100802153openalex-snapshot
On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
inferred← citeshttps://doi.org/10.1137/110858082openalex-snapshot
Generating Moment Matching Scenarios Using Optimization Techniques
inferred← citeshttps://doi.org/10.1137/130915261openalex-snapshot
Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
inferred← citeshttps://doi.org/10.1137/140976856openalex-snapshot
Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems
inferred← citeshttps://doi.org/10.1137/15m100883xopenalex-snapshot
Maximization of Matrix Trace Function of Product Stiefel Manifolds
inferred← citeshttps://doi.org/10.1137/s0895479898340299openalex-snapshot
On Lagrangian Relaxation of Quadratic Matrix Constraints
inferred← citeshttps://doi.org/10.1137/s1052623400373829openalex-snapshot
A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems
inferred← citeshttps://doi.org/10.1137/s1052623401388926openalex-snapshot
A Variant of the Vavasis--Ye Layered-Step Interior-Point Algorithm for Linear Programming
inferred← citeshttps://doi.org/10.1137/s105262340139001xopenalex-snapshot
New Results on Quadratic Minimization
inferred← citeshttps://doi.org/10.1137/s1052623401395899openalex-snapshot
Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
inferred← citeshttps://doi.org/10.1137/s1052623402416803openalex-snapshot
A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm
inferred← citeshttps://doi.org/10.1137/s1052623497328008openalex-snapshot
Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1137/s1052623498336450openalex-snapshot
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
inferred← citeshttps://doi.org/10.1145/3357713openalex-snapshot
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
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.