Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuoyin Li 0001
Person information
- affiliation: University of New South Wales, Department of Applied Mathematics, Australia
Other persons with the same name
- Guoyin Li 0002
![[0000-0002-9273-7864]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-9273-7864")
— CRRC SRI CHONGQING S&T Co., Ltd., Chongqing, China - Guoyin Li 0003 — Zhoukou Normal University, College of Life Science and Agronomy, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j79]Leyang Zhao, Guoyin Li, Spiridon I. Penev:
Regularized distributionally robust optimization with application to the index tracking problem. Ann. Oper. Res. 337(1): 397-424 (2024)- 2023
- [j78]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): 8 (2023) - [j77]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): 1763-1795 (2023) - [j76]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): 361-393 (2023) - 2022
- [j75]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): 749-763 (2022) - [j74]Peiran Yu, Guoyin Li, Ting Kei Pong:
Kurdyka-Łojasiewicz Exponent via Inf-projection. Found. Comput. Math. 22(4): 1171-1217 (2022) - [j73]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): 649-675 (2022) - [j72]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): 167-190 (2022) - [j71]Radu Ioan Bot, Minh N. Dao, Guoyin Li:
Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs. Math. Oper. Res. 47(3): 2415-2443 (2022) - 2021
- [j70]Sheng-Long Hu, Guoyin Li:
B-subdifferentials of the projection onto the matrix simplex. Comput. Optim. Appl. 80(3): 915-941 (2021) - [j69]V. Jeyakumar, Guoyin Li, Daniel Woolnough:
Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: Exact second-order cone program reformulations. EURO J. Comput. Optim. 9: 100019 (2021) - [j68]Thai Doan Chuong, V. Jeyakumar, Guoyin Li, Daniel 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): 1095-1117 (2021) - [j67]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): 378-401 (2021) - [j66]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): 597-622 (2021) - [j65]Daniel 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): 25-44 (2021) - 2020
- [j64]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): 441-452 (2020) - 2019
- [j63]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): 885-919 (2019) - [j62]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): 530-536 (2019) - 2018
- [j61]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): 19-25 (2018) - [j60]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): 40-50 (2018) - [j59]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): 1199-1232 (2018) - [j58]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): 551-569 (2018) - [j57]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): 313-346 (2018) - [j56]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) - [j55]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): 993-1031 (2018) - [j54]Vaithilingam Jeyakumar, Guoyin Li:
Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems. SIAM J. Optim. 28(1): 760-787 (2018) - 2017
- [j53]Guoyin Li, Tianxiang Liu, Ting Kei Pong:
Peaceman-Rachford splitting for a class of nonconvex optimization problems. Comput. Optim. Appl. 68(2): 407-436 (2017) - [j52]Vaithilingam Jeyakumar, Guoyin Li:
Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs. J. Optim. Theory Appl. 172(1): 156-178 (2017) - [j51]Dmitriy Drusvyatskiy, Guoyin Li, Henry Wolkowicz:
A note on alternating projections for ill-posed semidefinite feasibility problems. Math. Program. 162(1-2): 537-548 (2017) - [j50]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): 325-333 (2017) - [j49]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): 1-33 (2017) - 2016
- [j48]Haibin Chen, Guoyin Li, Liqun Qi:
Further results on Cauchy tensors and Hankel tensors. Appl. Math. Comput. 275: 50-62 (2016) - [j47]Vaithilingam Jeyakumar, S. Kim, Gue Myung Lee, Guoyin Li:
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets. J. Glob. Optim. 65(2): 175-190 (2016) - [j46]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): 446-474 (2016) - [j45]Guoyin Li, Ting Kei Pong:
Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems. Math. Program. 159(1-2): 371-401 (2016) - [j44]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): 67-73 (2016) - [j43]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): 753-780 (2016) - 2015
- [j42]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): 730-743 (2015) - [j41]Vaithilingam Jeyakumar, Gue Myung Lee, Guoyin Li:
Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty. J. Optim. Theory Appl. 164(2): 407-435 (2015) - [j40]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): 333-362 (2015) - [j39]Vaithilingam Jeyakumar, Guoyin Li, José Vicente-Pérez:
Robust SOS-convex polynomial optimization problems: exact SDP relaxations. Optim. Lett. 9(1): 1-18 (2015) - [j38]Vaithilingam Jeyakumar, Guoyin Li:
A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs. Oper. Res. Lett. 43(4): 405-410 (2015) - [j37]Guoyin Li, Ting Kei Pong:
Global Convergence of Splitting Methods for Nonconvex Composite Optimization. SIAM J. Optim. 25(4): 2434-2460 (2015) - 2014
- [j36]Guoyin Li, Alfred Ka Chun Ma, Ting Kei Pong:
Robust least square semidefinite programming with applications. Comput. Optim. Appl. 58(2): 347-379 (2014) - [j35]Gonglin Yuan, Zengxin Wei, Guoyin Li:
A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs. J. Comput. Appl. Math. 255: 86-96 (2014) - [j34]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): 31-50 (2014) - [j33]Vaithilingam Jeyakumar, Jean B. Lasserre, Guoyin Li:
On Polynomial Optimization Over Non-compact Semi-algebraic Sets. J. Optim. Theory Appl. 163(3): 707-718 (2014) - [j32]Vaithilingam Jeyakumar, Guoyin Li:
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization. Math. Program. 147(1-2): 171-206 (2014) - [j31]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): 34-40 (2014) - [j30]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): 498-527 (2014) - [j29]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): 1402-1419 (2014) - 2013
- [j28]Vaithilingam Jeyakumar, Guoyin Li, S. Srisatkunarajah:
Strong duality for robust minimax fractional programming problems. Eur. J. Oper. Res. 228(2): 331-336 (2013) - [j27]Vaithilingam Jeyakumar, Guoyin Li:
Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty. J. Glob. Optim. 55(2): 209-226 (2013) - [j26]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): 717-738 (2013) - [j25]Guoyin Li:
Global error bounds for piecewise convex polynomials. Math. Program. 137(1-2): 37-64 (2013) - [j24]Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, Marco A. López:
Robust linear semi-infinite programming duality under uncertainty. Math. Program. 139(1-2): 185-203 (2013) - [j23]Guoyin Li, Liqun Qi, Gaohang Yu:
The Z-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory. Numer. Linear Algebra Appl. 20(6): 1001-1029 (2013) - 2012
- [j22]Guoyin Li:
Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition. J. Optim. Theory Appl. 152(3): 710-726 (2012) - [j21]Vaithilingam Jeyakumar, Guoyin Li:
Exact SDP relaxations for classes of nonlinear semidefinite programming problems. Oper. Res. Lett. 40(6): 529-536 (2012) - [j20]Guoyin Li, Boris S. Mordukhovich:
Hölder Metric Subregularity with Applications to Proximal Point Method. SIAM J. Optim. 22(4): 1655-1684 (2012) - 2011
- [j19]Chun-Ming Tang, Jin-Bao Jian, Guoyin Li:
A working set SQCQP algorithm with simple nonmonotone penalty parameters. J. Comput. Appl. Math. 236(6): 1382-1398 (2011) - [j18]Vaithilingam Jeyakumar, Guoyin Li:
Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems. J. Glob. Optim. 49(1): 1-14 (2011) - [j17]Guoyin Li:
A Note on Nonconvex Minimax Theorem with Separable Homogeneous Polynomials. J. Optim. Theory Appl. 150(1): 194-203 (2011) - [j16]Vaithilingam Jeyakumar, Guoyin Li:
Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty. J. Optim. Theory Appl. 151(2): 292-303 (2011) - [j15]Vaithilingam Jeyakumar, Guoyin Li:
Necessary global optimality conditions for nonlinear programming problems with polynomial constraints. Math. Program. 126(2): 393-399 (2011) - [j14]Vaithilingam Jeyakumar, Guoyin Li, Gue Myung Lee:
A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty. Oper. Res. Lett. 39(2): 109-114 (2011) - 2010
- [j13]Vaithilingam Jeyakumar, Guoyin Li:
New strong duality results for convex programs with separable constraints. Eur. J. Oper. Res. 207(3): 1203-1209 (2010) - [j12]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): 2795-2806 (2010) - [j11]Vaithilingam Jeyakumar, Guoyin Li:
Characterizing robust set containments and solutions of uncertain linear programs without qualifications. Oper. Res. Lett. 38(3): 188-194 (2010) - [j10]Guoyin Li:
On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials. SIAM J. Optim. 20(4): 1923-1943 (2010) - [j9]Vaithilingam Jeyakumar, Guoyin Li:
Strong Duality in Robust Convex Programming: Complete Characterizations. SIAM J. Optim. 20(6): 3384-3407 (2010) - 2009
- [j8]Vaithilingam Jeyakumar, Guoyin Li:
Farkas' lemma for separable sublinear inequalities without qualifications. Optim. Lett. 3(4): 537-545 (2009) - [j7]Guoyin Li, Kung Fu Ng:
Error Bounds of Generalized D-Gap Functions for Nonsmooth and Nonmonotone Variational Inequality Problems. SIAM J. Optim. 20(2): 667-690 (2009) - [j6]Vaithilingam Jeyakumar, Gue Myung Lee, Guoyin Li:
Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization. SIAM J. Optim. 20(2): 983-1001 (2009) - 2008
- [j5]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): 2173-2193 (2008) - [j4]Guoyin Li, Kung Fu Ng:
On Extension of Fenchel Duality and its Application. SIAM J. Optim. 19(3): 1489-1509 (2008) - 2007
- [j3]Chun-Ming Tang, Zengxin Wei, Guoyin Li:
A new version of the Liu-Storey conjugate gradient method. Appl. Math. Comput. 189(1): 302-313 (2007) - 2006
- [j2]Zengxin Wei, Guoyin Li, Liqun Qi:
New quasi-Newton methods for unconstrained optimization problems. Appl. Math. Comput. 175(2): 1156-1188 (2006) - [j1]Zengxin Wei, Guoyin Li, Liqun Qi:
New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems. Appl. Math. Comput. 179(2): 407-430 (2006)
Informal and Other Publications
- 2015
- [i2]Guoyin Li, Ting Kei Pong:
Peaceman-Rachford splitting for a class of nonconvex optimization problems. CoRR abs/1507.00887 (2015) - 2014
- [i1]Guoyin Li, Ting Kei Pong:
Splitting methods for nonconvex composite optimization. CoRR abs/1407.0753 (2014)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-09 03:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
