Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Schweighofer, Markus
2004.
On the complexity of Schmüdgen's Positivstellensatz.
Journal of Complexity,
Vol. 20,
Issue. 4,
p.
529.
Marshall, M.
2005.
Error Estimates in the Optimization of Degree Two Polynomials on a Discrete Hypercube.
SIAM Journal on Optimization,
Vol. 16,
Issue. 1,
p.
297.
Jibetean, Dorina
and
Laurent, Monique
2005.
Semidefinite Approximations for Global Unconstrained Polynomial Optimization.
SIAM Journal on Optimization,
Vol. 16,
Issue. 2,
p.
490.
Schweighofer, Markus
2005.
Optimization of Polynomials on Compact Semialgebraic Sets.
SIAM Journal on Optimization,
Vol. 15,
Issue. 3,
p.
805.
Nie, Jiawang
Demmel, James
and
Sturmfels, Bernd
2006.
Minimizing Polynomials via Sum of Squares over the Gradient Ideal.
Mathematical Programming,
Vol. 106,
Issue. 3,
p.
587.
Lavaei, Javad
Sojoudi, Somayeh
and
Aghdam, Amir G.
2007.
Rational optimization using sum-of-squares techniques.
p.
4723.
Laurent, Monique
2007.
Semidefinite representations for finite varieties.
Mathematical Programming,
Vol. 109,
Issue. 1,
p.
1.
Nie, Jiawang
and
Schweighofer, Markus
2007.
On the complexity of Putinar's Positivstellensatz.
Journal of Complexity,
Vol. 23,
Issue. 1,
p.
135.
Vui, Hà Huy
and
So'n, Pham Tien
2008.
Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares.
SIAM Journal on Optimization,
Vol. 19,
Issue. 2,
p.
941.
Marshall, Murray
2008.
Representations of non-negative polynomials having finitely many zeros.
Annales de la Faculté des sciences de Toulouse : Mathématiques,
Vol. 15,
Issue. 3,
p.
599.
Laurent, Monique
2009.
Emerging Applications of Algebraic Geometry.
Vol. 149,
Issue. ,
p.
157.
Hà, Huy Vui
and
Phạm, Tiên Sȯn
2009.
Solving polynomial optimization problems via the truncated tangency variety and sums of squares.
Journal of Pure and Applied Algebra,
Vol. 213,
Issue. 11,
p.
2167.
Vui, Hà Huy
and
So'n, Pham Tien
2010.
Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets.
SIAM Journal on Optimization,
Vol. 20,
Issue. 6,
p.
3082.
Netzer, Tim
Plaumann, Daniel
and
Schweighofer, Markus
2010.
Exposed Faces of Semidefinitely Representable Sets.
SIAM Journal on Optimization,
Vol. 20,
Issue. 4,
p.
1944.
Ghasemi, Mehdi
and
Marshall, Murray
2012.
Lower Bounds for Polynomials Using Geometric Programming.
SIAM Journal on Optimization,
Vol. 22,
Issue. 2,
p.
460.
Nie, Jiawang
2013.
Polynomial Optimization with Real Varieties.
SIAM Journal on Optimization,
Vol. 23,
Issue. 3,
p.
1634.
Sekiguchi, Yoshiyuki
Takenawa, Tomoyuki
and
Waki, Hayato
2013.
Real ideal and the duality of semidefinite programming for polynomial optimization.
Japan Journal of Industrial and Applied Mathematics,
Vol. 30,
Issue. 2,
p.
321.
Công-Trình, Lê
2016.
Nonnegative Morse polynomial functions and polynomial optimization.
Positivity,
Vol. 20,
Issue. 2,
p.
483.
Nie, Jiawang
2017.
Symmetric Tensor Nuclear Norms.
SIAM Journal on Applied Algebra and Geometry,
Vol. 1,
Issue. 1,
p.
599.
Zhou, Anwa
and
Fan, Jinyan
2018.
Completely positive tensor recovery with minimal nuclear value.
Computational Optimization and Applications,
Vol. 70,
Issue. 2,
p.
419.