On the public citation graph
An approach to obtaining global extremums in polynomial mathematical programming problems
0 signed · 75 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.1007/bf01072102openalex-snapshot
Method of obtaining estimates in quadratic extremal problems with Boolean variables
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-0-387-09686-5_7openalex-snapshot
Sums of Squares, Moment Matrices and Optimization Over Polynomials
inferred← citeshttps://doi.org/10.1007/978-1-4614-0769-0_2openalex-snapshot
The Approach of Moments for Polynomial Equations
inferred← citeshttps://doi.org/10.1007/978-1-4614-4211-0_2openalex-snapshot
Optimization Methods and Their Efficient Use
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_38openalex-snapshot
Independent Sets in Semi-random Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_62openalex-snapshot
Query Complexity in Expectation
inferred← citeshttps://doi.org/10.1007/bf02733302openalex-snapshot
To the 70th anniversary of academician V. S. Mikhalevich academician V. S. Mikhalevich as a scientist and science organizer
inferred← citeshttps://doi.org/10.1007/s00037-017-0152-4openalex-snapshot
Tight Size-Degree Bounds for Sums-of-Squares Proofs
inferred← citeshttps://doi.org/10.1007/s00220-019-03382-yopenalex-snapshot
Limitations of Semidefinite Programs for Separable States and Entangled Games
inferred← citeshttps://doi.org/10.1007/s10107-004-0561-4openalex-snapshot
Semidefinite representations for finite varieties
inferred← citeshttps://doi.org/10.1007/s10107-013-0732-2openalex-snapshot
A Frank–Wolfe type theorem for nondegenerate polynomial programs
inferred← citeshttps://doi.org/10.1007/s10107-022-01793-9openalex-snapshot
Noisy tensor completion via the sum-of-squares hierarchy
inferred← citeshttps://doi.org/10.1007/s10208-020-09471-yopenalex-snapshot
Stable Rank-One Matrix Completion is Solved by the Level 2 Lasserre Relaxation
inferred← citeshttps://doi.org/10.1007/s10288-012-0210-3openalex-snapshot
Semidefinite relaxations for partitioning, assignment and ordering problems
inferred← citeshttps://doi.org/10.1007/s10479-015-2015-1openalex-snapshot
Semidefinite relaxations for partitioning, assignment and ordering problems
inferred← citeshttps://doi.org/10.1007/s10559-012-9387-xopenalex-snapshot
On N. Z. Shor’s three scientific ideas
inferred← citeshttps://doi.org/10.1007/s10559-025-00796-6openalex-snapshot
Scientific Legacy of Academician N. Z. Shor
inferred← citeshttps://doi.org/10.1007/s10898-026-01602-zopenalex-snapshot
Relaxations of KKT conditions do not strengthen finite RLT and SDP-RLT bounds for nonconvex quadratic programs
inferred← citeshttps://doi.org/10.1007/s10957-016-0910-5openalex-snapshot
Stability and Genericity for Semi-algebraic Compact Programs
inferred← citeshttps://doi.org/10.1007/s10957-024-02558-4openalex-snapshot
Polynomial Optimization: Tightening RLT-Based Branch-and-Bound Schemes with Conic Constraints
inferred← citeshttps://doi.org/10.1007/s40305-021-00347-8openalex-snapshot
Certifying the Global Optimality of Quartic Minimization over the Sphere
inferred← citeshttps://doi.org/10.1016/0377-2217(95)00199-9openalex-snapshot
Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid
inferred← citeshttps://doi.org/10.1016/j.crma.2015.11.009openalex-snapshot
A note on probably certifiably correct algorithms
inferred← citeshttps://doi.org/10.1016/j.ejcon.2024.101063openalex-snapshot
Trajectory generation for the unicycle model using semidefinite relaxations
inferred← citeshttps://doi.org/10.1016/j.jpaa.2009.03.014openalex-snapshot
Solving polynomial optimization problems via the truncated tangency variety and sums of squares
inferred← citeshttps://doi.org/10.1016/j.jsc.2022.04.015openalex-snapshot
Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12008-8openalex-snapshot
Semidefinite Programming and Integer Programming
inferred← citeshttps://doi.org/10.1073/pnas.1603405113openalex-snapshot
Inference on graphs via semidefinite programming
inferred← citeshttps://doi.org/10.1088/1742-5468/ac9cc8openalex-snapshot
Disordered systems insights on computational hardness
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00065openalex-snapshot
Efficient Certificates of Anti-Concentration Beyond Gaussians
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00101openalex-snapshot
Computational Hardness of Detecting Graph Lifts and Certifying Lift-Monotone Properties of Random Regular Graphs
inferred← citeshttps://doi.org/10.1109/lra.2024.3398433openalex-snapshot
Globally Optimal Inverse Kinematics as a Non-Convex Quadratically Constrained Quadratic Program
inferred← citeshttps://doi.org/10.1109/sampta.2017.8024470openalex-snapshot
Community detection in hypergraphs, spiked tensor models, and Sum-of-Squares
inferred← citeshttps://doi.org/10.1137/1.9781611973105.111openalex-snapshot
Approximability and proof complexity
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch105openalex-snapshot
Integrality Gaps and Approximation Algorithms for Dispersers and Bipartite Expanders
inferred← citeshttps://doi.org/10.1137/15m1010890openalex-snapshot
Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
inferred← citeshttps://doi.org/10.1137/16m1068992openalex-snapshot
Generic Properties for Semialgebraic Programs
inferred← citeshttps://doi.org/10.1137/16m1087734openalex-snapshot
Greedy Approaches to Symmetric Orthogonal Tensor Decomposition
inferred← citeshttps://doi.org/10.1137/18m1180396openalex-snapshot
The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime
inferred← citeshttps://doi.org/10.1137/22m1511394openalex-snapshot
The Spectrum of the Grigoriev–Laurent Pseudomoments
inferred← citeshttps://doi.org/10.1145/2213977.2214006openalex-snapshot
Hypercontractivity, sum-of-squares proofs, and their applications
inferred← citeshttps://doi.org/10.1145/2591796.2591886openalex-snapshot
Rounding sum-of-squares relaxations
inferred← citeshttps://doi.org/10.1145/2746539.2746599openalex-snapshot
Lower Bounds on the Size of Semidefinite Programming Relaxations
inferred← citeshttps://doi.org/10.1145/2746539.2746605openalex-snapshot
Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method
inferred← citeshttps://doi.org/10.1145/2746539.2746625openalex-snapshot
Sum of Squares Lower Bounds from Pairwise Independence
inferred← citeshttps://doi.org/10.1145/3406325.3451080openalex-snapshot
Automating algebraic proof systems is NP-hard
inferred← citeshttps://doi.org/10.1145/3564246.3585221openalex-snapshot
Sum-of-Squares Lower Bounds for Densest k-Subgraph
inferred← citeshttps://doi.org/10.1145/3717823.3718151openalex-snapshot
Sum-of-Squares Lower Bounds for Coloring Random Graphs
inferred← citeshttps://doi.org/10.1145/3717823.3718306openalex-snapshot
Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from Planted Clique and Noisy 𝑘-LIN over Expanders
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.28.3.470.16391openalex-snapshot
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
inferred← citeshttps://doi.org/10.1287/moor.28.4.871.20508openalex-snapshot
Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33017866openalex-snapshot
Polynomial-Time Probabilistic Reasoning with Partial Observations via Implicit Learning in Probability Logics
inferred← citeshttps://doi.org/10.17114/j.aua.2018.54.09openalex-snapshot
MINIMIZING POLYNOMIALS ON NONCOMPACT SETS
inferred← citeshttps://doi.org/10.34229/kca2522-9664.25.4.8openalex-snapshot
The scientific heritage of Academician Shor
inferred← citeshttps://doi.org/10.37070/aml.2021.38.1.07openalex-snapshot
Polinomiális optimalizálási feladatok és relaxációik
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2017.28openalex-snapshot
Detection in the stochastic block model with multiple clusters: proof of the achievability conjectures, acyclic BP, and the information-computation gap
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2015.448openalex-snapshot
Tight Size-Degree Bounds for Sums-of-Squares Proofs
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2016.17openalex-snapshot
On the Sum-of-Squares Degree of Symmetric Quadratic Functions
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2016.22openalex-snapshot
Tight SoS-Degree Bounds for Approximate Nash Equilibria
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2019.61openalex-snapshot
Sum of Squares Lower Bounds from Symmetry and a Good Story
inferred← citeshttps://doi.org/10.48550/arxiv.1404.5236openalex-snapshot
Sum-of-squares proofs and the quest toward optimal algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1411.6317openalex-snapshot
Lower bounds on the size of semidefinite programming relaxations
inferred← citeshttps://doi.org/10.48550/arxiv.1411.7280openalex-snapshot
Query complexity in expectation
inferred← citeshttps://doi.org/10.48550/arxiv.1507.06370openalex-snapshot
Sum-of-Squares Lower Bounds for Sparse PCA
inferred← citeshttps://doi.org/10.48550/arxiv.1709.03198openalex-snapshot
A Note on Property Testing Sum of Squares and Multivariate Polynomial Interpolation
inferred← citeshttps://doi.org/10.48550/arxiv.1801.00368openalex-snapshot
Stable rank one matrix completion is solved by two rounds of semidefinite programming relaxation
inferred← citeshttps://doi.org/10.48550/arxiv.2009.07269openalex-snapshot
Positivity-preserving extensions of sum-of-squares pseudomoments over the hypercube
inferred← citeshttps://doi.org/10.48550/arxiv.2011.04253openalex-snapshot
Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems
inferred← citeshttps://doi.org/10.48550/arxiv.2111.07834openalex-snapshot
Conditional Linear Regression for Heterogeneous Covariances
inferred← citeshttps://doi.org/10.5555/2627817.2627928openalex-snapshot
Approximability and proof complexity
inferred← citeshttps://doi.org/10.5555/2833227.2833250openalex-snapshot
Tight size-degree bounds for sums-of-squares proofs
inferred← citeshttps://doi.org/10.5555/2884435.2884477openalex-snapshot
Non-convex compressed sensing with the sum-of-squares method
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.