Year |
Citation |
Score |
2020 |
Klep I, Nie J. A Matrix Positivstellensatz with Lifting Polynomials Siam Journal On Optimization. 30: 240-261. DOI: 10.1137/18M1203183 |
0.357 |
|
2020 |
Nie J, Yang L, Zhong S. Stochastic Polynomial Optimization Optimization Methods & Software. 35: 329-347. DOI: 10.1080/10556788.2019.1649672 |
0.373 |
|
2020 |
Nie J. Preface to the special issue on optimization with polynomials and tensors Computational Optimization and Applications. 75: 607-608. DOI: 10.1007/S10589-020-00184-0 |
0.361 |
|
2019 |
Nie J, Ye K. Hankel Tensor Decompositions and Ranks Siam Journal On Matrix Analysis and Applications. 40: 486-516. DOI: 10.1137/18M1168285 |
0.364 |
|
2019 |
Nie J. Tight relaxations for polynomial optimization and Lagrange multiplier expressions Mathematical Programming. 178: 1-37. DOI: 10.1007/S10107-018-1276-2 |
0.396 |
|
2018 |
Nie J, Yang Z, Zhang X. A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors Siam Journal On Optimization. 28: 2902-2921. DOI: 10.1137/17M115308X |
0.31 |
|
2018 |
Fan J, Nie J, Zhao R. The maximum tensor complementarity eigenvalues Optimization Methods & Software. 1-12. DOI: 10.1080/10556788.2018.1528251 |
0.411 |
|
2018 |
Nie J, Zhang X. Real eigenvalues of nonsymmetric tensors Computational Optimization and Applications. 70: 1-32. DOI: 10.1007/S10589-017-9973-Y |
0.353 |
|
2017 |
Nie J. Low Rank Symmetric Tensor Approximations Siam Journal On Matrix Analysis and Applications. 38: 1517-1540. DOI: 10.1137/16M1107528 |
0.407 |
|
2017 |
Nie J. Symmetric Tensor Nuclear Norms Siam Journal On Applied Algebra and Geometry. 1: 599-625. DOI: 10.1137/16M1083384 |
0.319 |
|
2017 |
Nie J, Wang L, Ye JJ. Bilevel Polynomial Programs and Semidefinite Relaxation Methods Siam Journal On Optimization. 27: 1728-1757. DOI: 10.1137/15M1052172 |
0.418 |
|
2017 |
Fan J, Nie J, Zhou A. Tensor eigenvalue complementarity problems Mathematical Programming. 170: 507-539. DOI: 10.1007/S10107-017-1167-Y |
0.449 |
|
2016 |
Nie J, Zhang X. Positive Maps and Separable Matrices Siam Journal On Optimization. 26: 1236-1256. DOI: 10.1137/15M1018514 |
0.329 |
|
2015 |
Helton JW, Nie J, Semko JS. Free semidefinite representation of matrix power functions Linear Algebra and Its Applications. 465: 347-362. DOI: 10.1016/J.Laa.2014.09.038 |
0.325 |
|
2015 |
Nie J. Generating Polynomials and Symmetric Tensor Decompositions Foundations of Computational Mathematics. DOI: 10.1007/S10208-015-9291-7 |
0.402 |
|
2015 |
Nie J. The hierarchy of local minimums in polynomial optimization Mathematical Programming. 151: 555-583. DOI: 10.1007/S10107-014-0845-2 |
0.372 |
|
2014 |
Cui C, Dai Y, Nie J. All Real Eigenvalues of Symmetric Tensors Siam Journal On Matrix Analysis and Applications. 35: 1582-1601. DOI: 10.1137/140962292 |
0.426 |
|
2014 |
Nie J, Wang L. Semidefinite Relaxations for Best Rank-1 Tensor Approximations Siam Journal On Matrix Analysis and Applications. 35: 1155-1179. DOI: 10.1137/130935112 |
0.447 |
|
2014 |
Nie J. The A-Truncated K-Moment Problem Foundations of Computational Mathematics. 14: 1243-1276. DOI: 10.1007/S10208-014-9225-9 |
0.373 |
|
2014 |
Nie J. Linear optimization with cones of moments and nonnegative polynomials Mathematical Programming. 153: 247-274. DOI: 10.1007/S10107-014-0797-6 |
0.403 |
|
2014 |
Nie J. Optimality conditions and finite convergence of Lasserre's hierarchy Mathematical Programming. 146: 97-121. DOI: 10.1007/S10107-013-0680-X |
0.413 |
|
2013 |
Fialkow L, Nie J. On The Closure Of Positive Flat Moment Matrices Journal of Operator Theory. 69: 257-277. DOI: 10.7900/Jot.2010May11.1890 |
0.32 |
|
2013 |
Nie J. Polynomial optimization with real varieties Siam Journal On Optimization. 23: 1634-1646. DOI: 10.1137/120898772 |
0.4 |
|
2013 |
Nie J. An Approximation Bound Analysis for Lasserre's Relaxation in Multivariate Polynomial Optimization Journal of the Operations Research Society of China. 1: 313-332. DOI: 10.1007/S40305-013-0017-8 |
0.358 |
|
2013 |
Nie J. Certifying convergence of Lasserre's hierarchy via flat truncation Mathematical Programming. 142: 485-510. DOI: 10.1007/S10107-012-0589-9 |
0.414 |
|
2013 |
Nie J. An exact Jacobian SDP relaxation for polynomial optimization Mathematical Programming. 137: 225-255. DOI: 10.1007/S10107-011-0489-4 |
0.366 |
|
2012 |
Nie J, Wang L. Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization Siam Journal On Optimization. 22: 408-428. DOI: 10.1137/110825844 |
0.393 |
|
2012 |
Nie J. Discriminants and nonnegative polynomials Journal of Symbolic Computation. 47: 167-191. DOI: 10.1016/J.Jsc.2011.08.023 |
0.319 |
|
2012 |
Fialkow L, Nie J. The truncated moment problem via homogenization and flat extensions Journal of Functional Analysis. 263: 1682-1700. DOI: 10.1016/J.Jfa.2012.06.004 |
0.358 |
|
2012 |
Helton JW, Nie J. A Semidefinite Approach for Truncated K-Moment Problems Foundations of Computational Mathematics. 12: 851-881. DOI: 10.1007/S10208-012-9132-X |
0.347 |
|
2012 |
Nie J. First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials Mathematical Programming. 131: 1-36. DOI: 10.1007/S10107-009-0339-9 |
0.336 |
|
2011 |
Nie J. Polynomial matrix inequality and semidefinite representation Mathematics of Operations Research. 36: 398-415. DOI: 10.1287/Moor.1110.0498 |
0.367 |
|
2010 |
Ling C, Nie J, Qi L, Ye Y. Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations Siam Journal On Optimization. 20: 1286-1310. DOI: 10.1137/080729104 |
0.407 |
|
2010 |
Fialkow L, Nie J. Positivity of Riesz Functionals and Solutions of Quadratic and Quartic Moment Problems Journal of Functional Analysis. 258: 328-356. DOI: 10.1016/J.Jfa.2009.09.015 |
0.34 |
|
2010 |
Nie J, Ranestad K, Sturmfels B. The algebraic degree of semidefinite programming Mathematical Programming. 122: 379-405. DOI: 10.1007/S10107-008-0253-6 |
0.572 |
|
2010 |
Helton JW, Nie J. Semidefinite representation of convex sets Mathematical Programming. 122: 21-64. DOI: 10.1007/S10107-008-0240-Y |
0.378 |
|
2009 |
Nie J, Sturmfels B. Matrix cubes parameterized by eigenvalues Siam Journal On Matrix Analysis and Applications. 31: 755-766. DOI: 10.1137/080722606 |
0.591 |
|
2009 |
Nie J, Ranestad K. Algebraic Degree of Polynomial Optimization Siam Journal On Optimization. 20: 485-502. DOI: 10.1137/080716670 |
0.417 |
|
2009 |
Helton JW, Nie J. Sufficient and necessary conditions for semidefinite representability of convex hulls and sets Siam Journal On Optimization. 20: 759-791. DOI: 10.1137/07070526X |
0.384 |
|
2009 |
Nie J. Sum of squares method for sensor network localization Computational Optimization and Applications. 43: 151-179. DOI: 10.1007/S10589-007-9131-Z |
0.316 |
|
2008 |
He S, Luo Z, Nie J, Zhang S. Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization Siam Journal On Optimization. 19: 503-523. DOI: 10.1137/070679041 |
0.384 |
|
2008 |
Nie J, Demmel J. Sparse SOS relaxations for minimizing functions that are summations of smal l polynomials Siam Journal On Optimization. 19: 1534-1558. DOI: 10.1137/060668791 |
0.385 |
|
2008 |
Li B, Nie J, Zhi L. Approximate GCDs of polynomials and sparse SOS relaxations Theoretical Computer Science. 409: 200-210. DOI: 10.1016/J.Tcs.2008.09.003 |
0.442 |
|
2008 |
Nie J, Demmel J, Gu M. Global minimization of rational functions and the nearest GCDs Journal of Global Optimization. 40: 697-718. DOI: 10.1007/S10898-006-9119-8 |
0.368 |
|
2007 |
Demmel J, Nie J, Powers V. Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals Journal of Pure and Applied Algebra. 209: 189-200. DOI: 10.1016/J.Jpaa.2006.05.028 |
0.344 |
|
2007 |
Nie J, Schweighofer M. On the complexity of Putinar's Positivstellensatz Journal of Complexity. 23: 135-150. DOI: 10.1016/J.Jco.2006.07.002 |
0.346 |
|
2006 |
Nie J, Demmel J, Sturmfels B. Minimizing polynomials via sum of squares over the gradient ideal Mathematical Programming. 106: 587-606. DOI: 10.1007/S10107-005-0672-6 |
0.595 |
|
2005 |
Nie J, Demmel JW. Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares Journal of Global Optimization. 33: 511-525. DOI: 10.1007/S10898-005-2099-2 |
0.421 |
|
Show low-probability matches. |