New quasi-Newton methods for unconstrained optimization problems. - Zengxin Wei; Guoyin Li 001; Liqun Qi 001 (Appl. Math. Comput., 2006)

New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems. - Zengxin Wei; Guoyin Li 001; Liqun Qi 001 (Appl. Math. Comput., 2006)

A new version of the Liu-Storey conjugate gradient method. - Chun-Ming Tang 002; Zengxin Wei; Guoyin Li 001 (Appl. Math. Comput., 2007)

Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems. - Zeng Xin Wei; Guoyin Li 001; Liqun Qi 001 (Math. Comput., 2008)

On Extension of Fenchel Duality and its Application. - Guoyin Li 001; Kung Fu Ng (SIAM J. Optim., 2008)

Farkas' lemma for separable sublinear inequalities without qualifications. - Vaithilingam Jeyakumar; Guoyin Li 001 (Optim. Lett., 2009)

Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization. - Vaithilingam Jeyakumar; Gue Myung Lee; Guoyin Li 001 (SIAM J. Optim., 2009)

Error Bounds of Generalized D-Gap Functions for Nonsmooth and Nonmonotone Variational Inequality Problems. - Guoyin Li 001; Kung Fu Ng (SIAM J. Optim., 2009)

New strong duality results for convex programs with separable constraints. - Vaithilingam Jeyakumar; Guoyin Li 001 (Eur. J. Oper. Res., 2010)

Error bound results for generalized D-gap functions of nonsmooth variational inequality problems. - Guoyin Li 001; Chun-Ming Tang 002; Zengxin Wei (J. Comput. Appl. Math., 2010)

Characterizing robust set containments and solutions of uncertain linear programs without qualifications. - Vaithilingam Jeyakumar; Guoyin Li 001 (Oper. Res. Lett., 2010)

Strong Duality in Robust Convex Programming: Complete Characterizations. - Vaithilingam Jeyakumar; Guoyin Li 001 (SIAM J. Optim., 2010)

On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials. - Guoyin Li 001 (SIAM J. Optim., 2010)

A working set SQCQP algorithm with simple nonmonotone penalty parameters. - Chun-Ming Tang 002; Jin-Bao Jian; Guoyin Li 001 (J. Comput. Appl. Math., 2011)

Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems. - Vaithilingam Jeyakumar; Guoyin Li 001 (J. Glob. Optim., 2011)

Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty. - Vaithilingam Jeyakumar; Guoyin Li 001 (J. Optim. Theory Appl., 2011)

A Note on Nonconvex Minimax Theorem with Separable Homogeneous Polynomials. - Guoyin Li 001 (J. Optim. Theory Appl., 2011)

Necessary global optimality conditions for nonlinear programming problems with polynomial constraints. - Vaithilingam Jeyakumar; Guoyin Li 001 (Math. Program., 2011)

A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty. - Vaithilingam Jeyakumar; Guoyin Li 001; Gue Myung Lee (Oper. Res. Lett., 2011)

Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition. - Guoyin Li 001 (J. Optim. Theory Appl., 2012)

Exact SDP relaxations for classes of nonlinear semidefinite programming problems. - Vaithilingam Jeyakumar; Guoyin Li 001 (Oper. Res. Lett., 2012)

Hölder Metric Subregularity with Applications to Proximal Point Method. - Guoyin Li 001; Boris S. Mordukhovich (SIAM J. Optim., 2012)

Strong duality for robust minimax fractional programming problems. - Vaithilingam Jeyakumar; Guoyin Li 001; S. Srisatkunarajah (Eur. J. Oper. Res., 2013)

Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty. - Vaithilingam Jeyakumar; Guoyin Li 001 (J. Glob. Optim., 2013)

Finding the Maximum Eigenvalue of Essentially Nonnegative Symmetric Tensors via Sum of Squares Programming. - Sheng-Long Hu; Guoyin Li 001; Liqun Qi 001; Yisheng Song 001 (J. Optim. Theory Appl., 2013)

Robust linear semi-infinite programming duality under uncertainty. - Miguel A. Goberna; Vaithilingam Jeyakumar; Guoyin Li 001; Marco A. López 001 (Math. Program., 2013)

Global error bounds for piecewise convex polynomials. - Guoyin Li 001 (Math. Program., 2013)

The Z-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory. - Guoyin Li 001; Liqun Qi 001; Gaohang Yu (Numer. Linear Algebra Appl., 2013)

Robust least square semidefinite programming with applications. - Guoyin Li 001; Alfred Ka Chun Ma; Ting Kei Pong (Comput. Optim. Appl., 2014)

Splitting methods for nonconvex composite optimization. - Guoyin Li 001; Ting Kei Pong (CoRR, 2014)

A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs. - Gonglin Yuan; Zengxin Wei; Guoyin Li 001 (J. Comput. Appl. Math., 2014)

Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations. - Vaithilingam Jeyakumar; Guoyin Li 001; S. Srisatkunarajah (J. Glob. Optim., 2014)

On Polynomial Optimization Over Non-compact Semi-algebraic Sets. - Vaithilingam Jeyakumar; Jean B. Lasserre; Guoyin Li 001 (J. Optim. Theory Appl., 2014)

Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization. - Vaithilingam Jeyakumar; Guoyin Li 001 (Math. Program., 2014)

Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness. - Vaithilingam Jeyakumar; T. S. Pham; Guoyin Li 001 (Oper. Res. Lett., 2014)

Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets. - Jonathan M. Borwein; Guoyin Li 001; Liangjin Yao (SIAM J. Optim., 2014)

Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty. - Miguel A. Goberna; Vaithilingam Jeyakumar; Guoyin Li 001; José Vicente-Pérez (SIAM J. Optim., 2014)

Peaceman-Rachford splitting for a class of nonconvex optimization problems. - Guoyin Li 001; Ting Kei Pong (CoRR, 2015)

Robust solutions to multi-objective linear programs with uncertain data. - Miguel A. Goberna; Vaithilingam Jeyakumar; Guoyin Li 001; José Vicente-Pérez (Eur. J. Oper. Res., 2015)

Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty. - Vaithilingam Jeyakumar; Gue Myung Lee; Guoyin Li 001 (J. Optim. Theory Appl., 2015)

New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors. - Guoyin Li 001; Boris S. Mordukhovich; T. S. Pham (Math. Program., 2015)

Robust SOS-convex polynomial optimization problems: exact SDP relaxations. - Vaithilingam Jeyakumar; Guoyin Li 001; José Vicente-Pérez (Optim. Lett., 2015)

A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs. - Vaithilingam Jeyakumar; Guoyin Li 001 (Oper. Res. Lett., 2015)

Global Convergence of Splitting Methods for Nonconvex Composite Optimization. - Guoyin Li 001; Ting Kei Pong (SIAM J. Optim., 2015)

Further results on Cauchy tensors and Hankel tensors. - Haibin Chen; Guoyin Li 001; Liqun Qi 001 (Appl. Math. Comput., 2016)

Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets. - Vaithilingam Jeyakumar; S. Kim; Gue Myung Lee; Guoyin Li 001 (J. Glob. Optim., 2016)

A Tensor Analogy of Yuan's Theorem of the Alternative and Polynomial Optimization with Sign structure. - Sheng-Long Hu; Guoyin Li 001; Liqun Qi 001 (J. Optim. Theory Appl., 2016)

Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems. - Guoyin Li 001; Ting Kei Pong (Math. Program., 2016)

Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints. - Miguel A. Goberna; Vaithilingam Jeyakumar; Guoyin Li 001; Linh Nguyen (Oper. Res. Lett., 2016)

Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems. - Vaithilingam Jeyakumar; Jean B. Lasserre; Guoyin Li 001; T. S. Pham (SIAM J. Optim., 2016)

Peaceman-Rachford splitting for a class of nonconvex optimization problems. - Guoyin Li 001; Tianxiang Liu; Ting Kei Pong (Comput. Optim. Appl., 2017)

Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs. - Vaithilingam Jeyakumar; Guoyin Li 001 (J. Optim. Theory Appl., 2017)

A note on alternating projections for ill-posed semidefinite feasibility problems. - Dmitriy Drusvyatskiy; Guoyin Li 001; Henry Wolkowicz (Math. Program., 2017)

A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems. - N. H. Chieu; Vaithilingam Jeyakumar; Guoyin Li 001 (Oper. Res. Lett., 2017)

Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems. - Jonathan M. Borwein; Guoyin Li 001; Matthew K. Tam (SIAM J. Optim., 2017)

Constraint qualifications for convex optimization without convexity of constraints : New connections and applications to best approximation. - N. H. Chieu; Vaithilingam Jeyakumar; Guoyin Li 001; Hossein Mohebi (Eur. J. Oper. Res., 2018)

Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs. - Miguel A. Goberna; Vaithilingam Jeyakumar; Guoyin Li 001; José Vicente-Pérez (Eur. J. Oper. Res., 2018)

Calculus of the Exponent of Kurdyka-Łojasiewicz Inequality and Its Applications to Linear Convergence of First-Order Methods. - Guoyin Li 001; Ting Kei Pong (Found. Comput. Math., 2018)

Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations. - Immanuel M. Bomze; Vaithilingam Jeyakumar; Guoyin Li 001 (J. Glob. Optim., 2018)

Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates. - Guoyin Li 001; Boris S. Mordukhovich; Tran T. A. Nghia; T. S. Pham (Math. Program., 2018)

A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test. - Haibin Chen; Yannan Chen; Guoyin Li 001; Liqun Qi 001 (Numer. Linear Algebra Appl., 2018)

Convergence rate analysis for the higher order power method in best rank one approximations of tensors. - Sheng-Long Hu; Guoyin Li 001 (Numerische Mathematik, 2018)

Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems. - Vaithilingam Jeyakumar; Guoyin Li 001 (SIAM J. Optim., 2018)

A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs. - Thai Doan Chuong; V. Jeyakumar 001; Guoyin Li 001 (J. Glob. Optim., 2019)

A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints. - N. H. Chieu; Thai Doan Chuong; V. Jeyakumar 001; Guoyin Li 001 (Oper. Res. Lett., 2019)

Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality. - N. H. Chieu; V. Jeyakumar 001; Guoyin Li 001 (Eur. J. Oper. Res., 2020)

B-subdifferentials of the projection onto the matrix simplex. - Sheng-Long Hu; Guoyin Li 001 (Comput. Optim. Appl., 2021)

Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: Exact second-order cone program reformulations. - V. Jeyakumar 001; Guoyin Li 001; Daniel Woolnough (EURO J. Comput. Optim., 2021)

Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity. - Thai Doan Chuong; V. Jeyakumar 001; Guoyin Li 001; Daniel Woolnough (J. Glob. Optim., 2021)

On the Linear Convergence of Forward-Backward Splitting Method: Part I - Convergence Analysis. - José Yunier Bello Cruz; Guoyin Li 001; Tran T. A. Nghia (J. Optim. Theory Appl., 2021)

Calculating Radius of Robust Feasibility of Uncertain Linear Conic Programs via Semi-definite Programs. - Miguel A. Goberna; Vaithilingam Jeyakumar; Guoyin Li 001 (J. Optim. Theory Appl., 2021)

Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules. - Daniel Woolnough; Vaithilingam Jeyakumar; Guoyin Li 001 (Optim. Lett., 2021)

The radius of robust feasibility of uncertain mathematical programs: A Survey and recent developments. - Miguel A. Goberna; Vaithilingam Jeyakumar; Guoyin Li 001; José Vicente-Pérez (Eur. J. Oper. Res., 2022)

Kurdyka-Łojasiewicz Exponent via Inf-projection. - Peiran Yu; Guoyin Li 001; Ting Kei Pong (Found. Comput. Math., 2022)

Quadratic Growth Conditions and Uniqueness of Optimal Solution to Lasso. - José Yunier Bello Cruz; Guoyin Li 001; Tran T. A. Nghia (J. Optim. Theory Appl., 2022)

Robust Optimization and Data Classification for Characterization of Huntington Disease Onset via Duality Methods. - Daniel Woolnough; Niroshan Jeyakumar; Guoyin Li 001; Clement T. Loy; Vaithilingam Jeyakumar (J. Optim. Theory Appl., 2022)

Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs. - Radu Ioan Bot; Minh N. Dao; Guoyin Li 001 (Math. Oper. Res., 2022)

Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems. - Radu Ioan Bot; Minh N. Dao; Guoyin Li 001 (SIAM J. Optim., 2023)

Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints. - Yongle Zhang; Guoyin Li 001; Ting Kei Pong; Shiqi Xu (Adv. Comput. Math., 2023)

A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems. - Tan Nhat Pham; Minh N. Dao; Rakibuzzaman Shah; Nargiz Sultanova; Guoyin Li 001; Syed Mofizul Islam (Numer. Algorithms, 2023)

Piecewise SOS-convex moment optimization and applications via exact semi-definite programs. - Queenie Yingkun Huang; V. Jeyakumar 001; Guoyin Li 001 (EURO J. Comput. Optim., 2024)

Regularized distributionally robust optimization with application to the index tracking problem. - Leyang Zhao; Guoyin Li 001; Spiridon I. Penev (Ann. Oper. Res., 2024)

The Stability of Robustness for Conic Linear Programs with Uncertain Data. - Miguel A. Goberna; Vaithilingam Jeyakumar; Guoyin Li 001 (J. Optim. Theory Appl., 2024)

Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems. - Liaoyuan Zeng; Yongle Zhang; Guoyin Li 001; Ting Kei Pong; Xiaozhou Wang (Math. Program., 2024)

Convexifiable quadratic inequality systems: new minimax S-lemma and exact SOCPs for classes of distributionally robust optimization problems. - Queenie Yingkun Huang; Vaithilingam Jeyakumar; Guoyin Li 001; Duong Thi Kim Huyen (J. Glob. Optim., 2025)