| Year |
Citation |
Score |
| 2020 |
Chieu NH, Jeyakumar V, Li G. Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality European Journal of Operational Research. 280: 441-452. DOI: 10.1016/J.Ejor.2019.08.009 |
0.454 |
|
| 2020 |
Woolnough D, Jeyakumar V, Li G. Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules Optimization Letters. DOI: 10.1007/S11590-020-01595-Y |
0.365 |
|
| 2019 |
Tang C, Jian J, Li G. A proximal-projection partial bundle method for convex constrained minimax problems Journal of Industrial and Management Optimization. 15: 757-774. DOI: 10.3934/Jimo.2018069 |
0.47 |
|
| 2019 |
Feng J, Liu L, Wu D, Li G, Beer M, Gao W. Dynamic reliability analysis using the extended support vector regression (X-SVR) Mechanical Systems and Signal Processing. 126: 368-391. DOI: 10.1016/J.Ymssp.2019.02.027 |
0.328 |
|
| 2019 |
Chieu NH, Chuong TD, Jeyakumar V, Li G. A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints Operations Research Letters. 47: 530-536. DOI: 10.1016/J.Orl.2019.09.013 |
0.552 |
|
| 2019 |
Chuong TD, Jeyakumar V, Li G. A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs Journal of Global Optimization. 75: 885-919. DOI: 10.1007/S10898-019-00831-9 |
0.584 |
|
| 2018 |
Jeyakumar V, Li G. Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems Siam Journal On Optimization. 28: 760-787. DOI: 10.1137/16M1058480 |
0.52 |
|
| 2018 |
Goberna MA, Jeyakumar V, Li G, Vicente-Pérez J. Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs European Journal of Operational Research. 270: 40-50. DOI: 10.1016/J.Ejor.2018.03.018 |
0.462 |
|
| 2018 |
Chieu NH, Jeyakumar V, Li G, Mohebi H. Constraint qualifications for convex optimization without convexity of constraints : New connections and applications to best approximation European Journal of Operational Research. 265: 19-25. DOI: 10.1016/J.Ejor.2017.07.038 |
0.509 |
|
| 2018 |
Feng J, Wu D, Gao W, Li G. Hybrid uncertain natural frequency analysis for structures with random and interval fields Computer Methods in Applied Mechanics and Engineering. 328: 365-389. DOI: 10.1016/J.Cma.2017.09.004 |
0.347 |
|
| 2018 |
Chieu NH, Feng JW, Gao W, Li G, Wu D. SOS-Convex Semialgebraic Programs and its Applications to Robust Optimization: A Tractable Class of Nonsmooth Convex Optimization Set-Valued and Variational Analysis. 26: 305-326. DOI: 10.1007/S11228-017-0456-1 |
0.569 |
|
| 2018 |
Bomze IM, Jeyakumar V, Li G. Extended Trust-Region Problems with One or Two Balls: Exact Copositive and Lagrangian Relaxations Journal of Global Optimization. 71: 551-569. DOI: 10.1007/S10898-018-0607-4 |
0.522 |
|
| 2018 |
Li G, Pong TK. Calculus of the Exponent of Kurdyka–Łojasiewicz Inequality and Its Applications to Linear Convergence of First-Order Methods Foundations of Computational Mathematics. 18: 1199-1232. DOI: 10.1007/S10208-017-9366-8 |
0.524 |
|
| 2018 |
Hu S, Li G. Convergence rate analysis for the higher order power method in best rank one approximations of tensors Numerische Mathematik. 140: 993-1031. DOI: 10.1007/S00211-018-0981-3 |
0.396 |
|
| 2017 |
Borwein JM, Li G, Tam MK. Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems Siam Journal On Optimization. 27: 1-33. DOI: 10.1137/15M1045223 |
0.449 |
|
| 2017 |
Chieu NH, Jeyakumar V, Li G. A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems Operations Research Letters. 45: 325-333. DOI: 10.1016/J.Orl.2017.04.005 |
0.568 |
|
| 2017 |
Che M, Li G, Qi L, Wei Y. Pseudo-spectra theory of tensors and tensor polynomial eigenvalue problems Linear Algebra and Its Applications. 533: 536-572. DOI: 10.1016/J.Laa.2017.07.026 |
0.444 |
|
| 2017 |
Feng J, Wu D, Gao W, Li G. Uncertainty analysis for structures with hybrid random and interval parameters using mathematical programming approach Applied Mathematical Modelling. 48: 208-232. DOI: 10.1016/J.Apm.2017.03.066 |
0.371 |
|
| 2017 |
Jeyakumar V, Li G. Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs Journal of Optimization Theory and Applications. 172: 156-178. DOI: 10.1007/S10957-016-1023-X |
0.51 |
|
| 2017 |
Li G, Liu T, Pong TK. Peaceman–Rachford splitting for a class of nonconvex optimization problems Computational Optimization and Applications. 68: 407-436. DOI: 10.1007/S10589-017-9915-8 |
0.536 |
|
| 2017 |
Drusvyatskiy D, Li G, Wolkowicz H. A note on alternating projections for ill-posed semidefinite feasibility problems Mathematical Programming. 162: 537-548. DOI: 10.1007/S10107-016-1048-9 |
0.34 |
|
| 2017 |
Chen H, Chen Y, Li G, Qi L. A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test Numerical Linear Algebra With Applications. 25: e2125. DOI: 10.1002/Nla.2125 |
0.42 |
|
| 2016 |
Chen H, Li G, Qi L. SOS tensor decomposition: Theory and applications Communications in Mathematical Sciences. 14: 2073-2100. DOI: 10.4310/Cms.2016.V14.N8.A1 |
0.374 |
|
| 2016 |
Jeyakumar V, Lasserre JB, Li G, Phạm TS. Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems Siam Journal On Optimization. 26: 753-780. DOI: 10.1137/15M1017922 |
0.496 |
|
| 2016 |
Goberna MA, Jeyakumar V, Li G, Linh N. Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints Operations Research Letters. 44: 67-73. DOI: 10.1016/J.Orl.2015.11.011 |
0.524 |
|
| 2016 |
Chen H, Li G, Qi L. Further results on Cauchy tensors and Hankel tensors Applied Mathematics and Computation. 275: 50-62. DOI: 10.1016/J.Amc.2015.11.051 |
0.375 |
|
| 2016 |
Hu S, Li G, Qi L. A Tensor Analogy of Yuan’s Theorem of the Alternative and Polynomial Optimization with Sign structure Journal of Optimization Theory and Applications. 168: 446-474. DOI: 10.1007/S10957-014-0652-1 |
0.565 |
|
| 2016 |
Li G, Mordukhovich BS, Nghia TTA, Phạm TS. Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates Mathematical Programming. 1-34. DOI: 10.1007/S10107-016-1014-6 |
0.561 |
|
| 2015 |
Li G, Pong TK. Global convergence of splitting methods for nonconvex composite op timization Siam Journal On Optimization. 25: 2434-2460. DOI: 10.1137/140998135 |
0.475 |
|
| 2015 |
Jeyakumar V, Li G. A new class of alternative theorems for SOS-convex inequalities and robust optimization Applicable Analysis. 94: 56-74. DOI: 10.1080/00036811.2013.859251 |
0.572 |
|
| 2015 |
Jeyakumar V, Li G. A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs Operations Research Letters. 43: 405-410. DOI: 10.1016/J.Orl.2015.05.006 |
0.472 |
|
| 2015 |
Goberna MA, Jeyakumar V, Li G, Vicente-Pérez J. Robust solutions to multi-objective linear programs with uncertain data European Journal of Operational Research. 242: 730-743. DOI: 10.1016/J.Ejor.2014.10.027 |
0.446 |
|
| 2015 |
Wu D, Gao W, Li G, Tangaramvong S, Tin-Loi F. Robust assessment of collapse resistance of structures under uncertain loads based on Info-Gap model Computer Methods in Applied Mechanics and Engineering. 285: 208-227. DOI: 10.1016/J.Cma.2014.10.038 |
0.398 |
|
| 2015 |
Jeyakumar V, Li G, Vicente-Pérez J. Robust SOS-convex polynomial optimization problems: exact SDP relaxations Optimization Letters. 9: 1-18. DOI: 10.1007/S11590-014-0732-Z |
0.551 |
|
| 2015 |
Jeyakumar V, Lee GM, Li G. Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty Journal of Optimization Theory and Applications. 164: 407-435. DOI: 10.1007/S10957-014-0564-0 |
0.525 |
|
| 2015 |
Jeyakumar V, Kim S, Lee GM, Li G. Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets Journal of Global Optimization. DOI: 10.1007/S10898-015-0356-6 |
0.517 |
|
| 2015 |
Li G, Pong TK. Douglas–Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems Mathematical Programming. 1-31. DOI: 10.1007/S10107-015-0963-5 |
0.521 |
|
| 2014 |
Goberna MA, Jeyakumar V, Li G, Vicente-Pérez J. Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty Siam Journal On Optimization. 24: 1402-1419. DOI: 10.1137/130939596 |
0.482 |
|
| 2014 |
Borwein JM, Li G, Yao L. Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets Siam Journal On Optimization. 24: 498-527. DOI: 10.1137/130919052 |
0.425 |
|
| 2014 |
Jeyakumar V, Li G, Suthaharan S. Support vector machine classifiers with uncertain knowledge sets via robust optimization Optimization. 63: 1099-1116. DOI: 10.1080/02331934.2012.703667 |
0.5 |
|
| 2014 |
Jeyakumar V, Phạm TS, Li G. Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness Operations Research Letters. 42: 34-40. DOI: 10.1016/J.Orl.2013.11.005 |
0.561 |
|
| 2014 |
Yuan G, Wei Z, Li G. A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs Journal of Computational and Applied Mathematics. 255: 86-96. DOI: 10.1016/J.Cam.2013.04.032 |
0.476 |
|
| 2014 |
Jeyakumar V, Lasserre JB, Li G. On Polynomial Optimization Over Non-compact Semi-algebraic Sets Journal of Optimization Theory and Applications. 163: 707-718. DOI: 10.1007/S10957-014-0545-3 |
0.583 |
|
| 2014 |
Jeyakumar V, Li G, Srisatkunarajah S. Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations Journal of Global Optimization. 58: 31-50. DOI: 10.1007/S10898-013-0058-X |
0.561 |
|
| 2014 |
Li G, Ma AKC, Pong TK. Robust least square semidefinite programming with applications Computational Optimization and Applications. 58: 347-379. DOI: 10.1007/S10589-013-9634-8 |
0.572 |
|
| 2014 |
Li G, Mordukhovich BS, Phạm TS. New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors Mathematical Programming. 153: 333-362. DOI: 10.1007/S10107-014-0806-9 |
0.49 |
|
| 2013 |
Li G, Qi L, Yu G. Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application Linear Algebra and Its Applications. 438: 813-833. DOI: 10.1016/J.Laa.2011.10.043 |
0.486 |
|
| 2013 |
Jeyakumar V, Li G, Srisatkunarajah S. Strong duality for robust minimax fractional programming problems European Journal of Operational Research. 228: 331-336. DOI: 10.1016/J.Ejor.2013.02.015 |
0.504 |
|
| 2013 |
Hu S, Li G, Qi L, Song Y. Finding the Maximum Eigenvalue of Essentially Nonnegative Symmetric Tensors via Sum of Squares Programming Journal of Optimization Theory and Applications. 158: 717-738. DOI: 10.1007/S10957-013-0293-9 |
0.556 |
|
| 2013 |
Goberna MA, Jeyakumar V, Li G, López MA. Robust linear semi-infinite programming duality under uncertainty Mathematical Programming. 139: 185-203. DOI: 10.1007/S10107-013-0668-6 |
0.546 |
|
| 2013 |
Li G. Global error bounds for piecewise convex polynomials Mathematical Programming. 137: 37-64. DOI: 10.1007/S10107-011-0481-Z |
0.484 |
|
| 2013 |
Li G, Qi L, Yu G. The Z
-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory Numerical Linear Algebra With Applications. 20: 1001-1029. DOI: 10.1002/Nla.1877 |
0.425 |
|
| 2012 |
Li G, Mordukhovich BS. Hölder metric subregularity with applications to proximal point method Siam Journal On Optimization. 22: 1655-1684. DOI: 10.1137/120864660 |
0.4 |
|
| 2012 |
Jeyakumar V, Li G. Exact SDP relaxations for classes of nonlinear semidefinite programming problems Operations Research Letters. 40: 529-536. DOI: 10.1016/J.Orl.2012.09.006 |
0.524 |
|
| 2012 |
Jeyakumar V, Li G, Lee GM. Robust duality for generalized convex programming problems under data uncertainty Nonlinear Analysis-Theory Methods & Applications. 75: 1362-1373. DOI: 10.1016/J.Na.2011.04.006 |
0.562 |
|
| 2012 |
Jeyakumar V, Wang JH, Li G. Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty Journal of Mathematical Analysis and Applications. 393: 285-297. DOI: 10.1016/J.Jmaa.2012.03.037 |
0.428 |
|
| 2012 |
Li G. Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition Journal of Optimization Theory and Applications. 152: 710-726. DOI: 10.1007/S10957-011-9930-3 |
0.494 |
|
| 2011 |
Tang CM, Jian JB, Li GY. A working set SQCQP algorithm with simple nonmonotone penalty parameters Journal of Computational and Applied Mathematics. 236: 1382-1398. DOI: 10.1016/J.Cam.2011.09.002 |
0.437 |
|
| 2011 |
Jeyakumar V, Li G. Robust Farkas’ lemma for uncertain linear systems with applications Positivity. 15: 331-342. DOI: 10.1007/S11117-010-0078-4 |
0.431 |
|
| 2011 |
Jeyakumar V, Li G. Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty Journal of Optimization Theory and Applications. 151: 292-303. DOI: 10.1007/S10957-011-9896-1 |
0.483 |
|
| 2011 |
Jeyakumar V, Li G. Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems Journal of Global Optimization. 49: 1-14. DOI: 10.1007/S10898-009-9518-8 |
0.57 |
|
| 2010 |
Li G. On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials Siam Journal On Optimization. 20: 1923-1943. DOI: 10.1137/080733668 |
0.425 |
|
| 2010 |
Jeyakumar V, Li G. Characterizing robust set containments and solutions of uncertain linear programs without qualifications Operations Research Letters. 38: 188-194. DOI: 10.1016/J.Orl.2009.12.004 |
0.443 |
|
| 2010 |
Jeyakumar V, Li G. New strong duality results for convex programs with separable constraints European Journal of Operational Research. 207: 1203-1209. DOI: 10.1016/J.Ejor.2010.07.007 |
0.486 |
|
| 2010 |
Li G, Tang C, Wei Z. Error bound results for generalized D-gap functions of nonsmooth variational inequality problems Journal of Computational and Applied Mathematics. 233: 2795-2806. DOI: 10.1016/J.Cam.2009.11.025 |
0.513 |
|
| 2009 |
Li G, Ng KF. Error Bounds of Generalized D-Gap Functions for Nonsmooth and Nonmonotone Variational Inequality Problems Siam Journal On Optimization. 20: 667-690. DOI: 10.1137/070696283 |
0.612 |
|
| 2009 |
Jeyakumar V, Li G. Farkas’ lemma for separable sublinear inequalities without qualifications Optimization Letters. 3: 537-545. DOI: 10.1007/S11590-009-0133-X |
0.512 |
|
| 2009 |
Jeyakumar V, Huy NQ, Li G. Necessary and sufficient conditions for S-lemma and nonconvex quadratic optimization Optimization and Engineering. 10: 491-503. DOI: 10.1007/S11081-008-9076-9 |
0.442 |
|
| 2008 |
Yu G, Guan L, Li G. Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property Journal of Industrial and Management Optimization. 4: 565-579. DOI: 10.3934/Jimo.2008.4.565 |
0.333 |
|
| 2008 |
Li G, Tang C, Yu G, Wei Z. On a separation principle for nonconvex sets Set-Valued Analysis. 16: 851-860. DOI: 10.1007/S11228-008-0099-3 |
0.417 |
|
| 2007 |
Li G, Ng KF, Zheng XY. Unified approach to some geometric results in variational analysis Journal of Functional Analysis. 248: 317-343. DOI: 10.1016/J.Jfa.2007.04.001 |
0.664 |
|
| 2007 |
Li G, Tang C, Wei Z. New conjugacy condition and related new conjugate gradient methods for unconstrained optimization Journal of Computational and Applied Mathematics. 202: 523-539. DOI: 10.1016/J.Cam.2006.03.005 |
0.377 |
|
| 2007 |
Tang Cm, Wei Zx, Li Gy. A new version of the Liu-Storey conjugate gradient method Applied Mathematics and Computation. 189: 302-313. DOI: 10.1016/J.Amc.2006.11.098 |
0.339 |
|
| 2006 |
Wei Z, Li G, Qi L. New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems Applied Mathematics and Computation. 179: 407-430. DOI: 10.1016/J.Amc.2005.11.150 |
0.447 |
|
| 2006 |
Wei Z, Li G, Qi L. New quasi-Newton methods for unconstrained optimization problems Applied Mathematics and Computation. 175: 1156-1188. DOI: 10.1016/J.Amc.2005.08.027 |
0.411 |
|
| Show low-probability matches. |