On the public citation graph
On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
0 signed · 48 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/10997703_15openalex-snapshot
Detecting Global Optimality and Extracting Solutions in GloptiPoly
inferredcites →https://doi.org/10.1007/978-1-4613-0251-3_6openalex-snapshot
Global Optimization of Homogeneous Polynomials on the Simplex and on the Sphere
inferredcites →https://doi.org/10.1007/978-3-319-64546-9_12openalex-snapshot
The Moment Problem on Compact Semi-Algebraic Sets
inferredcites →https://doi.org/10.1007/978-3-662-04648-7openalex-snapshot
Positive Polynomials: From Hilbert’s 17th Problem to Real Algebra
inferredcites →https://doi.org/10.1007/s00209-003-0568-1openalex-snapshot
Sums of squares on real algebraic curves
inferredcites →https://doi.org/10.1007/s10107-003-0387-5openalex-snapshot
Semidefinite programming relaxations for semialgebraic problems
inferredcites →https://doi.org/10.1016/s0022-4049(00)00155-9openalex-snapshot
A new bound for Pólya's Theorem with applications to polynomials positive on polyhedra
inferredcites →https://doi.org/10.1023/a:1020209017701openalex-snapshot
Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming
inferredcites →https://doi.org/10.1137/03060151xopenalex-snapshot
LMI Approximations for Cones of Positive Semidefinite Forms
inferredcites →https://doi.org/10.1137/s1052623400366802openalex-snapshot
Global Optimization with Polynomials and the Problem of Moments
inferredcites →https://doi.org/10.1137/s1052623401383248openalex-snapshot
Approximation of the Stability Number of a Graph via Copositive Programming
inferredcites →https://doi.org/10.7907/2k6y-ch43.openalex-snapshot
Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.683106openalex-extracted
A Linear Programming Reformulation of the Standard Quadratic Optimization Problem
inferred← citeshttps://doi.org/10.1007/0-387-25592-3_5openalex-snapshot
Interior Point and Semidefinite Approaches in Combinatorial Optimization
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-3-030-21170-7_1openalex-snapshot
A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis
inferred← citeshttps://doi.org/10.1007/978-3-031-38659-6_4openalex-snapshot
Copositive Matrices, Sums of Squares and the Stability Number of a Graph
inferred← citeshttps://doi.org/10.1007/s00220-017-2859-0openalex-snapshot
An Improved Semidefinite Programming Hierarchy for Testing Entanglement
inferred← citeshttps://doi.org/10.1007/s00498-026-00445-zopenalex-snapshot
LMI hierarchies for stability analysis of ReLU feedback systems
inferred← citeshttps://doi.org/10.1007/s10107-019-01465-1openalex-snapshot
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
inferred← citeshttps://doi.org/10.1007/s10107-020-01537-7openalex-snapshot
The sum-of-squares hierarchy on the sphere and applications in quantum information theory
inferred← citeshttps://doi.org/10.1007/s10107-022-01878-5openalex-snapshot
Homogenization for polynomial optimization with unbounded sets
inferred← citeshttps://doi.org/10.1007/s10107-024-02149-1openalex-snapshot
Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs
inferred← citeshttps://doi.org/10.1007/s10107-025-02251-yopenalex-snapshot
A hierarchy of eigencomputations for polynomial optimization on the sphere
inferred← citeshttps://doi.org/10.1007/s10208-005-0178-xopenalex-snapshot
Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace
inferred← citeshttps://doi.org/10.1007/s10898-006-9037-9openalex-snapshot
A linear programming reformulation of the standard quadratic optimization problem
inferred← citeshttps://doi.org/10.1007/s10898-011-9749-3openalex-snapshot
Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization
inferred← citeshttps://doi.org/10.1007/s10898-013-0123-5openalex-snapshot
Handelman’s hierarchy for the maximum stable set problem
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/j.jfa.2012.06.004openalex-snapshot
The truncated moment problem via homogenization and flat extensions
inferred← citeshttps://doi.org/10.1016/j.laa.2022.06.015openalex-snapshot
On the exactness of sum-of-squares approximations for the cone of 5 × 5 copositive matrices
inferred← citeshttps://doi.org/10.1016/j.orl.2012.09.006openalex-snapshot
Exact SDP relaxations for classes of nonlinear semidefinite programming problems
inferred← citeshttps://doi.org/10.1016/j.orl.2013.11.005openalex-snapshot
Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.05.011openalex-snapshot
A PTAS for the minimization of polynomials of fixed degree over the simplex
inferred← citeshttps://doi.org/10.1109/cdc.2007.4434948openalex-snapshot
Rational optimization using sum-of-squares techniques
inferred← citeshttps://doi.org/10.1109/tac.2007.914238openalex-snapshot
Robust Stability of LTI Systems Over Semialgebraic Sets Using Sum-of-Squares Matrix Polynomials
inferred← citeshttps://doi.org/10.1137/100814147openalex-snapshot
On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
inferred← citeshttps://doi.org/10.1137/14097865xopenalex-snapshot
Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone
inferred← citeshttps://doi.org/10.1137/23m1611798openalex-snapshot
Sum-of-Squares Certificates for Copositivity via Test States
inferred← citeshttps://doi.org/10.1137/24m1717750openalex-snapshot
Moment-Sos and Spectral Hierarchies for Polynomial Optimization on the Sphere and Quantum de Finetti Theorems
inferred← citeshttps://doi.org/10.1287/moor.2018.0962openalex-snapshot
On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity
inferred← citeshttps://doi.org/10.1287/moor.2022.1290openalex-snapshot
Exactness of Parrilo’s Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph
inferred← citeshttps://doi.org/10.15807/jorsj.54.161openalex-snapshot
AN EXTENSION OF THE ELIMINATION METHOD FOR A SPARSE SOS POLYNOMIAL( SCOPE (Seminar on Computation and OPtimization for new Extensions))
inferred← citeshttps://doi.org/10.48550/arxiv.1710.02901openalex-snapshot
Response to "Counterexample to global convergence of DSOS and SDSOS hierarchies"
inferred← citeshttps://doi.org/10.48550/arxiv.1806.06996openalex-snapshot
Optimization over Nonnegative and Convex Polynomials With and Without Semidefinite Programming
inferred← citeshttps://doi.org/10.7282/t31r6pvropenalex-snapshot
Optimization models for shape-constrained function estimation problems involving nonnegative polynomials and their restrictions
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.