By Professor Guoyin Li

Journal articles

Drusvyatskiy D; Li G; Wolkowicz H, 2017, 'A note on alternating projections for ill-posed semidefinite feasibility problems', Mathematical Programming, 162, pp. 537 - 548, http://dx.doi.org/10.1007/s10107-016-1048-9

Borwein JM; Li G; Tam MK, 2017, 'Convergence rate analysis for averaged fixed point iterations in common fixed point problems', SIAM Journal on Optimization, 27, pp. 1 - 33, http://dx.doi.org/10.1137/15M1045223

Jeyakumar V; Li G, 2017, 'Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs', Journal of Optimization Theory and Applications, 172, pp. 156 - 178, http://dx.doi.org/10.1007/s10957-016-1023-x

Wang Q; Li G; Qi L; Xu Y, 2017, 'New classes of positive semi-definite Hankel tensors', Minimax Theory and its Applications, 2, pp. 231 - 248

Li G; Pong TK, 2016, 'Douglas–Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems', Mathematical Programming, 159, pp. 371 - 401, http://dx.doi.org/10.1007/s10107-015-0963-5

Jeyakumar V; Kim S; Lee GM; Li G, 2016, 'Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets', Journal of Global Optimization, 65, pp. 175 - 190, http://dx.doi.org/10.1007/s10898-015-0356-6

Chen H; Li G; Qi L, 2016, 'Further results on Cauchy tensors and Hankel tensors', Applied Mathematics and Computation, 275, pp. 50 - 62, http://dx.doi.org/10.1016/j.amc.2015.11.051

Hu S; Li G; Qi L, 2016, 'A Tensor Analogy of Yuan’s Theorem of the Alternative and Polynomial Optimization with Sign structure', Journal of Optimization Theory and Applications, 168, pp. 446 - 474, http://dx.doi.org/10.1007/s10957-014-0652-1

Jeyakumary V; Lasserre JB; Li G; Pham TS; Jeyakumar J, 2016, 'Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems', SIAM Journal on Optimization, 26, pp. 753 - 780, http://dx.doi.org/10.1137/15M1017922

Li G; Qi L; Wang Q, 2016, 'Positive semi-definiteness of generalized anti-circulant tensors', Communications in Mathematical Sciences, 14, pp. 941 - 952, http://dx.doi.org/10.4310/cms.2016.v14.n4.a3

Goberna MA; Jeyakumar V; Li G; Linh N, 2016, 'Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints', Operations Research Letters, 44, pp. 67 - 73, http://dx.doi.org/10.1016/j.orl.2015.11.011

Chen H; Li G; Qi L, 2016, 'SOS tensor decomposition: Theory and applications', Communications in Mathematical Sciences, 14, pp. 2073 - 2100, http://dx.doi.org/10.4310/cms.2016.v14.n8.a1

Li G; Mordukhovich BS; Phạm TS, 2015, 'New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors', Mathematical Programming, 153, pp. 333 - 362, http://dx.doi.org/10.1007/s10107-014-0806-9

Jeyakumar V; Li G, 2015, 'A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs', Operations Research Letters, 43, pp. 405 - 410, http://dx.doi.org/10.1016/j.orl.2015.05.006

Goberna MA; Jeyakumar V; Li G; Vicente-Pérez J, 2015, 'Robust solutions to multi-objective linear programs with uncertain data', European Journal of Operational Research, 242, pp. 730 - 743, http://dx.doi.org/10.1016/j.ejor.2014.10.027

Wu D; Gao W; Li G; Tangaramvong S; Tin-Loi F, 2015, 'Robust assessment of collapse resistance of structures under uncertain loads based on Info-Gap model', Computer Methods in Applied Mechanics and Engineering, 285, pp. 208 - 227, http://dx.doi.org/10.1016/j.cma.2014.10.038

Jeyakumar V; Lee GM; Li G, 2015, 'Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty', Journal of Optimization Theory and Applications, 164, pp. 407 - 435, http://dx.doi.org/10.1007/s10957-014-0564-0

Jeyakumar V; Li G, 2015, 'A new class of alternative theorems for SOS-convex inequalities and robust optimization', Applicable Analysis, 94, pp. 56 - 74, http://dx.doi.org/10.1080/00036811.2013.859251

Li G; Pong TK, 2015, 'Global convergence of splitting methods for nonconvex composite op timization', SIAM Journal on Optimization, 25, pp. 2434 - 2460, http://dx.doi.org/10.1137/140998135

Jeyakumar V; Li G; Vicente-Pérez J, 2015, 'Robust SOS-convex polynomial optimization problems: exact SDP relaxations', Optimization Letters, 9, pp. 1 - 18, http://dx.doi.org/10.1007/s11590-014-0732-z

Jeyakumar V; Lasserre JB; Li G, 2014, 'On Polynomial Optimization Over Non-compact Semi-algebraic Sets', Journal of Optimization Theory and Applications, 163, pp. 707 - 718, http://dx.doi.org/10.1007/s10957-014-0545-3

Jeyakumar V; Li GY, 2014, 'Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization', Mathematical Programming, 147, pp. 171 - 206, http://dx.doi.org/10.1007/s10107-013-0716-2

Yuan G; Wei Z; Li G, 2014, 'A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs', Journal of Computational and Applied Mathematics, 255, pp. 86 - 96, http://dx.doi.org/10.1016/j.cam.2013.04.032

Borwein JM; Li G; Yao L, 2014, 'Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets', SIAM Journal on Optimization, 24, pp. 498 - 527, http://dx.doi.org/10.1137/130919052

Jeyakumar V; Phaìm TS; Li G, 2014, 'Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness', Operations Research Letters, 42, pp. 34 - 40, http://dx.doi.org/10.1016/j.orl.2013.11.005

Li G; Ma AKC; Pong TK, 2014, 'Robust least square semidefinite programming with applications', Computational Optimization and Applications, 58, pp. 347 - 379, http://dx.doi.org/10.1007/s10589-013-9634-8

Goberna MA; Jeyakumar V; Li G; Vicente-Pérez J, 2014, 'Robust solutions of multiobjective linear semi-infinite programs under constraint data uncertainty', SIAM Journal on Optimization, 24, pp. 1402 - 1419, http://dx.doi.org/10.1137/130939596

Jeyakumar V; Li G; Srisatkunarajah S, 2014, 'Global Optimality Principles for Polynomial Optimization over Box or Bivalent Constraints by Separable Polynomial Approximations', Journal of Global Optimization, 58, pp. 31 - 50, http://dx.doi.org/10.1007/s10898-013-0058-x

Hu S; Li G; Qi L; Song Y, 2013, 'Finding the Maximum Eigenvalue of Essentially Nonnegative Symmetric Tensors via Sum of Squares Programming', Journal of Optimization and its application, 158, pp. 717 - 738, http://web.maths.unsw.edu.au/~gyli/papers/JOTA.pdf

Li G, 2013, 'Global error bounds for piecewise convex polynomials', Mathematical Programming, Series A, 137, pp. 37 - 64, http://dx.doi.org/10.1007/s10107-011-0481-z

Jeyakumar V; Li G; Mordukhovich B; Wang J, 2013, 'Robust best approximation with interpolation constraints under ellipsoidal uncertainty: Strong duality and nonsmooth Newton methods', Nonlinear Analysis - Theory Methods and Applications, 81, pp. 1 - 11, http://dx.doi.org/10.1016/j.na.2012.12.009

Bot R; Jeyakumar V; Li G, 2013, 'Robust duality in parametric convex optimization', Set-Valued and Variational Analysis, 21, pp. 177 - 189, http://link.springer.com/article/10.1007/s11228-012-0219-y

Goberna MA; Jeyakumar V; Li G; López MA, 2013, 'Robust linear semi-infinite programming duality under uncertainty', Mathematical Programming, 139, pp. 185 - 203, http://dx.doi.org/10.1007/s10107-013-0668-6

Jeyakumar V; Li G, 2013, 'Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty', Journal of Global Optimization, 55, pp. 209 - 226, http://dx.doi.org/10.1007/s10898-012-9857-8

Li G; Qi L; Yu G, 2013, 'Semismoothness of the Maximum Eigenvalue Function of a Symmetric Tensor and its Application', Linear Algebra and its Applications, 438, pp. 813 - 833, http://dx.doi.org/10.1016/j.laa.2011.10.043

Jeyakumar V; Li G; Wang J, 2013, 'Some robust convex programs without duality gap', Journal of Convex Analysis, 20, pp. 377 - 394, http://web.maths.unsw.edu.au/~gyli/papers/jlw_duality_gap.pdf

Jeyakumar V; Li G; Srisatkunarajah S, 2013, 'Strong duality for robust minimax fractional programming problems', European Journal of Operational Research, 228, pp. 331 - 336, http://dx.doi.org/10.1016/j.ejor.2013.02.015

Li G; Qi L; Yu G, 2013, 'The Z-eigenvalues of a Symmetric Tensor and its Application to Spectral Hypergraph Theory', Numerical Linear Algebra with Applications, http://dx.doi.org/10.1002/nla.1877

Jeyakumar V; Li G, 2012, 'Exact SDP relaxations for classes of nonlinear semidefinite programming problems', Operations Research Letters, 40, pp. 529 - 536, http://dx.doi.org/10.1016/j.orl.2012.09.006

Li G, 2012, 'Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition', Journal of Optimization Theory and Applications, 152, pp. 710 - 726, http://dx.doi.org/10.1007/s10957-011-9930-3

Li G; Mordukhovich B, 2012, 'Hölder Metric Subregularity with Applications to Proximal Point Method', SIAM Journal on Optimization, 22, pp. 1655 - 1684, http://dx.doi.org/10.1137/120864660

Jeyakumar V; Wang J; Li G, 2012, 'Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty', Journal of Mathematical Analysis and Applications, 393, pp. 285 - 297, http://dx.doi.org/10.1016/j.jmaa.2012.03.037

Jeyakumar V; Li G; Lee GM, 2012, 'Robust duality for generalized convex programming prolems under data uncertainty', Nonlinear Analysis - Theory Methods and Applications, 75, pp. 1362 - 1373, http://dx.doi.org/10.1016/j.na.2011.04.006

Jeyakumar V; Li G, 2012, 'Strong duality in robust semi-definite linear programming under data uncertainty', Optimization, http://dx.doi.org/10.1080/02331934.2012.690760

Jeyakumar V; Li G; Suthaharan S, 2012, 'Support vector machine classifiers with uncertain knowledge sets via robust optimization', Optimization, http://dx.doi.org/10.1080/02331934.2012.703667

Tang CM; Jian JB; Li GY, 2011, 'A working set SQCQP algorithm with simple nonmonotone penalty parameters', Journal of Computational and Applied Mathematics, 236, pp. 1382 - 1398, http://dx.doi.org/10.1016/j.cam.2011.09.002

Li G, 2011, 'A note on nonconvex minimax theorem with separable homogeneous polynomials', Journal of Optimization Theory and Applications, 150, pp. 194 - 203, http://dx.doi.org/10.1007/s10957-011-9827-1

Jeyakumar V; Li G; Lee GM, 2011, 'A robust Von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty', Operations Research Letters, 39, pp. 109 - 114, http://dx.doi.org/10.1016/j.orl.2011.02.007

Jeyakumar V; Li G, 2011, 'Necessary global optimality conditions for nonlinear programming problems with polynomial constraints', Mathematical Programming, 126, pp. 393 - 399, http://dx.doi.org/10.1007/s10107-009-0283-8

Jeyakumar V; Li G, 2011, 'Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems', Journal of Global Optimization, 49, pp. 1 - 14, http://dx.doi.org/10.1007/s10898-009-9518-8

Back to profile page