Guoyin Li

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 38

Top Topics

Optimization Problems

Convex Programs

Top Venues

J. Optim. Theory Appl.

Oper. Res. Lett.

J. Glob. Optim.

Publications

Queenie Yingkun Huang, V. Jeyakumar, Guoyin Li
Piecewise SOS-convex moment optimization and applications via exact semi-definite programs. EURO J. Comput. Optim. 12 (2024)
Leyang Zhao, Guoyin Li, Spiridon I. Penev
Regularized distributionally robust optimization with application to the index tracking problem. Ann. Oper. Res. 337 (1) (2024)
Tan Nhat Pham, Minh N. Dao, Rakibuzzaman Shah, Nargiz Sultanova, Guoyin Li, Syed Mofizul Islam
A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems. Numer. Algorithms 94 (4) (2023)
Radu Ioan Bot, Minh N. Dao, Guoyin Li
Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems. SIAM J. Optim. 33 (2) (2023)
Yongle Zhang, Guoyin Li, Ting Kei Pong, Shiqi Xu
Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints. Adv. Comput. Math. 49 (1) (2023)
José Yunier Bello Cruz, Guoyin Li, Tran T. A. Nghia
Quadratic Growth Conditions and Uniqueness of Optimal Solution to Lasso. J. Optim. Theory Appl. 194 (1) (2022)
Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez
The radius of robust feasibility of uncertain mathematical programs: A Survey and recent developments. Eur. J. Oper. Res. 296 (3) (2022)
Radu Ioan Bot, Minh N. Dao, Guoyin Li
Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs. Math. Oper. Res. 47 (3) (2022)
Daniel Woolnough, Niroshan Jeyakumar, Guoyin Li, Clement T. Loy, Vaithilingam Jeyakumar
Robust Optimization and Data Classification for Characterization of Huntington Disease Onset via Duality Methods. J. Optim. Theory Appl. 193 (1) (2022)
Peiran Yu, Guoyin Li, Ting Kei Pong
Kurdyka-Łojasiewicz Exponent via Inf-projection. Found. Comput. Math. 22 (4) (2022)
Sheng-Long Hu, Guoyin Li
B-subdifferentials of the projection onto the matrix simplex. Comput. Optim. Appl. 80 (3) (2021)
D. Woolnough, Vaithilingam Jeyakumar, Guoyin Li
Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules. Optim. Lett. 15 (1) (2021)
José Yunier Bello Cruz, Guoyin Li, Tran T. A. Nghia
On the Linear Convergence of Forward-Backward Splitting Method: Part I - Convergence Analysis. J. Optim. Theory Appl. 188 (2) (2021)
Thai Doan Chuong, V. Jeyakumar, Guoyin Li, D. Woolnough
Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity. J. Glob. Optim. 81 (4) (2021)
Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li
Calculating Radius of Robust Feasibility of Uncertain Linear Conic Programs via Semi-definite Programs. J. Optim. Theory Appl. 189 (2) (2021)
V. Jeyakumar, Guoyin Li, D. Woolnough
Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: Exact second-order cone program reformulations. EURO J. Comput. Optim. 9 (2021)
N. H. Chieu, V. Jeyakumar, Guoyin Li
Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality. Eur. J. Oper. Res. 280 (2) (2020)
Thai Doan Chuong, V. Jeyakumar, Guoyin Li
A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs. J. Glob. Optim. 75 (4) (2019)
N. H. Chieu, Thai Doan Chuong, V. Jeyakumar, Guoyin Li
A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints. Oper. Res. Lett. 47 (6) (2019)
N. H. Chieu, Vaithilingam Jeyakumar, Guoyin Li, Hossein Mohebi
Constraint qualifications for convex optimization without convexity of constraints : New connections and applications to best approximation. Eur. J. Oper. Res. 265 (1) (2018)
Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez
Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs. Eur. J. Oper. Res. 270 (1) (2018)
Haibin Chen, Yannan Chen, Guoyin Li, Liqun Qi
A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test. Numer. Linear Algebra Appl. 25 (1) (2018)
Guoyin Li, Ting Kei Pong
Calculus of the Exponent of Kurdyka-Łojasiewicz Inequality and Its Applications to Linear Convergence of First-Order Methods. Found. Comput. Math. 18 (5) (2018)
Vaithilingam Jeyakumar, Guoyin Li
Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems. SIAM J. Optim. 28 (1) (2018)
Guoyin Li, Boris S. Mordukhovich, Tran T. A. Nghia, T. S. Pham
Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates. Math. Program. 168 (1-2) (2018)
Immanuel M. Bomze, Vaithilingam Jeyakumar, Guoyin Li
Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations. J. Glob. Optim. 71 (3) (2018)
Sheng-Long Hu, Guoyin Li
Convergence rate analysis for the higher order power method in best rank one approximations of tensors. Numerische Mathematik 140 (4) (2018)
Vaithilingam Jeyakumar, Guoyin Li
Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs. J. Optim. Theory Appl. 172 (1) (2017)
N. H. Chieu, Vaithilingam Jeyakumar, Guoyin Li
A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems. Oper. Res. Lett. 45 (4) (2017)
Dmitriy Drusvyatskiy, Guoyin Li, Henry Wolkowicz
A note on alternating projections for ill-posed semidefinite feasibility problems. Math. Program. 162 (1-2) (2017)
Jonathan M. Borwein, Guoyin Li, Matthew K. Tam
Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems. SIAM J. Optim. 27 (1) (2017)
Guoyin Li, Tianxiang Liu, Ting Kei Pong
Peaceman-Rachford splitting for a class of nonconvex optimization problems. Comput. Optim. Appl. 68 (2) (2017)
Haibin Chen, Guoyin Li, Liqun Qi
Further results on Cauchy tensors and Hankel tensors. Appl. Math. Comput. 275 (2016)
Guoyin Li, Ting Kei Pong
Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems. Math. Program. 159 (1-2) (2016)
Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, Linh Nguyen
Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints. Oper. Res. Lett. 44 (1) (2016)
Vaithilingam Jeyakumar, S. Kim, G. M. Lee, Guoyin Li
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets. J. Glob. Optim. 65 (2) (2016)
Sheng-Long Hu, Guoyin Li, Liqun Qi
A Tensor Analogy of Yuan's Theorem of the Alternative and Polynomial Optimization with Sign structure. J. Optim. Theory Appl. 168 (2) (2016)
Vaithilingam Jeyakumar, Jean B. Lasserre, Guoyin Li, T. S. Pham
Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems. SIAM J. Optim. 26 (1) (2016)
Guoyin Li, Ting Kei Pong
Peaceman-Rachford splitting for a class of nonconvex optimization problems. CoRR (2015)
Vaithilingam Jeyakumar, Guoyin Li
A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs. Oper. Res. Lett. 43 (4) (2015)
Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez
Robust solutions to multi-objective linear programs with uncertain data. Eur. J. Oper. Res. 242 (3) (2015)
Guoyin Li, Ting Kei Pong
Global Convergence of Splitting Methods for Nonconvex Composite Optimization. SIAM J. Optim. 25 (4) (2015)
Guoyin Li, Boris S. Mordukhovich, T. S. Pham
New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors. Math. Program. 153 (2) (2015)
Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez
Robust SOS-convex polynomial optimization problems: exact SDP relaxations. Optim. Lett. 9 (1) (2015)
Vaithilingam Jeyakumar, G. M. Lee, Guoyin Li
Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty. J. Optim. Theory Appl. 164 (2) (2015)
Vaithilingam Jeyakumar, Guoyin Li
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization. Math. Program. 147 (1-2) (2014)
Guoyin Li, Alfred Ka Chun Ma, Ting Kei Pong
Robust least square semidefinite programming with applications. Comput. Optim. Appl. 58 (2) (2014)
Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez
Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty. SIAM J. Optim. 24 (3) (2014)
Guoyin Li, Ting Kei Pong
Splitting methods for nonconvex composite optimization. CoRR (2014)
Gonglin Yuan, Zengxin Wei, Guoyin Li
A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs. J. Comput. Appl. Math. 255 (2014)
Jonathan M. Borwein, Guoyin Li, Liangjin Yao
Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets. SIAM J. Optim. 24 (1) (2014)
Vaithilingam Jeyakumar, T. S. Pham, Guoyin Li
Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness. Oper. Res. Lett. 42 (1) (2014)
Vaithilingam Jeyakumar, Jean B. Lasserre, Guoyin Li
On Polynomial Optimization Over Non-compact Semi-algebraic Sets. J. Optim. Theory Appl. 163 (3) (2014)
Vaithilingam Jeyakumar, Guoyin Li, S. Srisatkunarajah
Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations. J. Glob. Optim. 58 (1) (2014)
Guoyin Li
Global error bounds for piecewise convex polynomials. Math. Program. 137 (1-2) (2013)
Guoyin Li, Liqun Qi, Gaohang Yu
-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory. Numer. Linear Algebra Appl. 20 (6) (2013)
Vaithilingam Jeyakumar, Guoyin Li
Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty. J. Glob. Optim. 55 (2) (2013)
Sheng-Long Hu, Guoyin Li, Liqun Qi, Yisheng Song
Finding the Maximum Eigenvalue of Essentially Nonnegative Symmetric Tensors via Sum of Squares Programming. J. Optim. Theory Appl. 158 (3) (2013)
Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, Marco A. López
Robust linear semi-infinite programming duality under uncertainty. Math. Program. 139 (1-2) (2013)
Vaithilingam Jeyakumar, Guoyin Li, S. Srisatkunarajah
Strong duality for robust minimax fractional programming problems. Eur. J. Oper. Res. 228 (2) (2013)
Vaithilingam Jeyakumar, Guoyin Li
Exact SDP relaxations for classes of nonlinear semidefinite programming problems. Oper. Res. Lett. 40 (6) (2012)
Guoyin Li, Boris S. Mordukhovich
Hölder Metric Subregularity with Applications to Proximal Point Method. SIAM J. Optim. 22 (4) (2012)
Guoyin Li
Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition. J. Optim. Theory Appl. 152 (3) (2012)
Vaithilingam Jeyakumar, Guoyin Li, G. M. Lee
A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty. Oper. Res. Lett. 39 (2) (2011)
Chun-Ming Tang, Jin-Bao Jian, Guoyin Li
A working set SQCQP algorithm with simple nonmonotone penalty parameters. J. Comput. Appl. Math. 236 (6) (2011)
Vaithilingam Jeyakumar, Guoyin Li
Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty. J. Optim. Theory Appl. 151 (2) (2011)
Vaithilingam Jeyakumar, Guoyin Li
Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems. J. Glob. Optim. 49 (1) (2011)
Vaithilingam Jeyakumar, Guoyin Li
Necessary global optimality conditions for nonlinear programming problems with polynomial constraints. Math. Program. 126 (2) (2011)
Vaithilingam Jeyakumar, Guoyin Li
New strong duality results for convex programs with separable constraints. Eur. J. Oper. Res. 207 (3) (2010)
Vaithilingam Jeyakumar, Guoyin Li
Strong Duality in Robust Convex Programming: Complete Characterizations. SIAM J. Optim. 20 (6) (2010)
Vaithilingam Jeyakumar, Guoyin Li
Characterizing robust set containments and solutions of uncertain linear programs without qualifications. Oper. Res. Lett. 38 (3) (2010)
Guoyin Li
On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials. SIAM J. Optim. 20 (4) (2010)
Guoyin Li, Chun-Ming Tang, Zengxin Wei
Error bound results for generalized D-gap functions of nonsmooth variational inequality problems. J. Comput. Appl. Math. 233 (11) (2010)
Vaithilingam Jeyakumar, G. M. Lee, Guoyin Li
Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization. SIAM J. Optim. 20 (2) (2009)
Vaithilingam Jeyakumar, Guoyin Li
Farkas' lemma for separable sublinear inequalities without qualifications. Optim. Lett. 3 (4) (2009)
Guoyin Li, Kung Fu Ng
Error Bounds of Generalized D-Gap Functions for Nonsmooth and Nonmonotone Variational Inequality Problems. SIAM J. Optim. 20 (2) (2009)
Guoyin Li, Kung Fu Ng
On Extension of Fenchel Duality and its Application. SIAM J. Optim. 19 (3) (2008)
Zeng Xin Wei, Guoyin Li, Liqun Qi
Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems. Math. Comput. 77 (264) (2008)
Chun-Ming Tang, Zengxin Wei, Guoyin Li
A new version of the Liu-Storey conjugate gradient method. Appl. Math. Comput. 189 (1) (2007)
Zengxin Wei, Guoyin Li, Liqun Qi
New quasi-Newton methods for unconstrained optimization problems. Appl. Math. Comput. 175 (2) (2006)
Zengxin Wei, Guoyin Li, Liqun Qi
New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems. Appl. Math. Comput. 179 (2) (2006)