Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Helton, J. William
and
Nie, Jiawang
2010.
Semidefinite representation of convex sets.
Mathematical Programming,
Vol. 122,
Issue. 1,
p.
21.
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.
Ghasemi, Mehdi
and
Marshall, Murray
2010.
Lower bounds for a polynomial in terms of its coefficients.
Archiv der Mathematik,
Vol. 95,
Issue. 4,
p.
343.
Man–Cho So, Anthony
2011.
Wiley Encyclopedia of Operations Research and Management Science.
Ghasemi, Mehdi
and
Marshall, Murray
2012.
Lower Bounds for Polynomials Using Geometric Programming.
SIAM Journal on Optimization,
Vol. 22,
Issue. 2,
p.
460.
Lasserre, Jean B.
2013.
Inverse Polynomial Optimization.
Mathematics of Operations Research,
Vol. 38,
Issue. 3,
p.
418.
Lasserre, Jean B.
2013.
A Lagrangian Relaxation View of Linear and Semidefinite Hierarchies.
SIAM Journal on Optimization,
Vol. 23,
Issue. 3,
p.
1742.
Nie, Jiawang
2013.
Polynomial Optimization with Real Varieties.
SIAM Journal on Optimization,
Vol. 23,
Issue. 3,
p.
1634.
Nie, Jiawang
2013.
An exact Jacobian SDP relaxation for polynomial optimization.
Mathematical Programming,
Vol. 137,
Issue. 1-2,
p.
225.
Jeyakumar, V.
Phạm, T.S.
and
Li, G.
2014.
Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness.
Operations Research Letters,
Vol. 42,
Issue. 1,
p.
34.
Dinh, Si Tiep
Ha, Huy Vui
and
Pham, Tien Son
2014.
A Frank–Wolfe type theorem for nondegenerate polynomial programs.
Mathematical Programming,
Vol. 147,
Issue. 1-2,
p.
519.
2014.
Nie, Jiawang
2014.
Optimality conditions and finite convergence of Lasserre’s hierarchy.
Mathematical Programming,
Vol. 146,
Issue. 1-2,
p.
97.
Cerone, Vito
Lasserre, Jean-Bernard
Piga, Dario
and
Regruto, Diego
2014.
A Unified Framework for Solving a General Class of Conditional and Robust Set-Membership Estimation Problems.
IEEE Transactions on Automatic Control,
Vol. 59,
Issue. 11,
p.
2897.
Jeyakumar, V.
Lasserre, J. B.
and
Li, G.
2014.
On Polynomial Optimization Over Non-compact Semi-algebraic Sets.
Journal of Optimization Theory and Applications,
Vol. 163,
Issue. 3,
p.
707.
Cerone, V.
Razza, V.
and
Regruto, D.
2015.
One-shot set-membership identification of Wiener models with polynomial nonlinearities.
IFAC-PapersOnLine,
Vol. 48,
Issue. 28,
p.
957.
Zhou, Guangming
Deng, Chao
and
Wu, Kun
2016.
Semidefinite Optimization Estimating Bounds on Linear Functionals Defined on Solutions of Linear ODEs.
Advances in Applied Mathematics and Mechanics,
Vol. 8,
Issue. 4,
p.
599.
Cerone, Vito
Razza, Valentino
and
Regruto, D.
2016.
MIMO linear systems identification in the presence of bounded noise.
p.
919.
Cerone, V.
Razza, V.
and
Regruto, D.
2016.
Bounded error identification exploiting a-priori information on noise whiteness and noise/output correlation.
p.
3793.
Dang, Văn Doạt
Hà, Huy Vui
and
Phạm, Tien Son
2016.
Well-Posedness in Unconstrained Polynomial Optimization Problems.
SIAM Journal on Optimization,
Vol. 26,
Issue. 3,
p.
1411.