Guoyin Li

发表

A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2015, Oper. Res. Lett..

Strong Duality in Robust Convex Programming: Complete Characterizations

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2010, SIAM J. Optim..

Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2011, J. Glob. Optim..

Error Bounds of Generalized D-Gap Functions for Nonsmooth and Nonmonotone Variational Inequality Problems

Guoyin Li, Kung Fu Ng, K. Ng, 2009, SIAM J. Optim..

On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials

Guoyin Li, 2010, SIAM J. Optim..

Finding the Maximum Eigenvalue of Essentially Nonnegative Symmetric Tensors via Sum of Squares Programming

Guoyin Li, Liqun Qi, Yisheng Song, 2013, J. Optim. Theory Appl..

New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors

Boris S. Mordukhovich, Guoyin Li, T. S. Pham, 2015, Math. Program..

Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations

Vaithilingam Jeyakumar, Guoyin Li, S. Srisatkunarajah, 2014, J. Glob. Optim..

Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization

Vaithilingam Jeyakumar, Guoyin Li, G. M. Lee, 2009, SIAM J. Optim..

Constraint qualifications for convex optimization without convexity of constraints : New connections and applications to best approximation

Vaithilingam Jeyakumar, Guoyin Li, Hossein Mohebi, 2018, Eur. J. Oper. Res..

A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs

Guoyin Li, Gonglin Yuan, Zengxin Wei, 2014, J. Comput. Appl. Math..

Farkas’ lemma for separable sublinear inequalities without qualifications

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2009, Optim. Lett..

Robust least square semidefinite programming with applications

Guoyin Li, Ting Kei Pong, Alfred Ka Chun Ma, 2014, Comput. Optim. Appl..

A note on alternating projections for ill-posed semidefinite feasibility problems

Dmitriy Drusvyatskiy, Henry Wolkowicz, Guoyin Li, 2017, Math. Program..

Characterizing robust set containments and solutions of uncertain linear programs without qualifications

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2010, Oper. Res. Lett..

A new version of the Liu-Storey conjugate gradient method

Guoyin Li, Chun-Ming Tang, Zengxin Wei, 2007, Appl. Math. Comput..

Hölder Metric Subregularity with Applications to Proximal Point Method

Boris S. Mordukhovich, Guoyin Li, B. Mordukhovich, 2012, SIAM J. Optim..

Symmetric-Strong-Tracking-Extended-Kalman-Filter-Based Sensorless Control of Induction Motor Drives for Modeling Error Reduction

Jing Liu, Guoyin Li, Zhonggang Yin, 2019, IEEE Transactions on Industrial Informatics.

Further results on Cauchy tensors and Hankel tensors

Guoyin Li, Liqun Qi, Haibin Chen, 2015, Appl. Math. Comput..

Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets

S. Kim, Vaithilingam Jeyakumar, Guoyin Li, 2016, J. Glob. Optim..

Uncertainty analysis for structures with hybrid random and interval parameters using mathematical programming approach

Di Wu, Wei Gao, Guoyin Li, 2017 .

Douglas–Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems

Guoyin Li, Ting Kei Pong, Guoyin Li, 2014, Math. Program..

Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems

Vaithilingam Jeyakumar, Guoyin Li, Jean B. Lasserre, 2015, SIAM J. Optim..

A working set SQCQP algorithm with simple nonmonotone penalty parameters

Guoyin Li, Chun-Ming Tang, Jin-Bao Jian, 2011, J. Comput. Appl. Math..

Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems

Guoyin Li, Liqun Qi, Zeng Xin Wei, 2008, Math. Comput..

A Tensor Analogy of Yuan’s Theorem of the Alternative and Polynomial Optimization with Sign structure

Guoyin Li, Liqun Qi, Sheng-Long Hu, 2014, J. Optim. Theory Appl..

New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems

Guoyin Li, Zengxin Wei, Liqun Qi, 2006, Appl. Math. Comput..

Calculus of the Exponent of Kurdyka–Łojasiewicz Inequality and Its Applications to Linear Convergence of First-Order Methods

Guoyin Li, Ting Kei Pong, Guoyin Li, 2016, Foundations of Computational Mathematics.

Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets

Jonathan M. Borwein, Guoyin Li, Liangjin Yao, 2013, SIAM J. Optim..

Splitting methods for nonconvex composite optimization pdf

Guoyin Li, Ting Kei Pong, 2014, ArXiv.

Dynamic reliability analysis using the extended support vector regression (X-SVR)

Lei Liu, Michael Beer, Guoyin Li, 2019, Mechanical Systems and Signal Processing.

A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty

Vaithilingam Jeyakumar, Guoyin Li, G. M. Lee, 2011, Oper. Res. Lett..

Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2013, Mathematical Programming.

Global error bounds for piecewise convex polynomials

Guoyin Li, Guoyin Li, 2013, Math. Program..

New strong duality results for convex programs with separable constraints

Vaithilingam Jeyakumar, Guoyin Li, 2010, Eur. J. Oper. Res..

Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs

Vaithilingam Jeyakumar, Guoyin Li, 2017, J. Optim. Theory Appl..

Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations

Vaithilingam Jeyakumar, Guoyin Li, Immanuel M. Bomze, 2017, J. Glob. Optim..

Convergence rate analysis for the higher order power method in best rank one approximations of tensors

Guoyin Li, Sheng-Long Hu, Guoyin Li, 2018, Numerische Mathematik.

A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems

Vaithilingam Jeyakumar, Guoyin Li, N. H. Chieu, 2017, Oper. Res. Lett..

On Polynomial Optimization Over Non-compact Semi-algebraic Sets

Vaithilingam Jeyakumar, Guoyin Li, Jean B. Lasserre, 2013, J. Optim. Theory Appl..

Global Convergence of Splitting Methods for Nonconvex Composite Optimization

Guoyin Li, Ting Kei Pong, Guoyin Li, 2014, SIAM J. Optim..

A Speed and Flux Observer of Induction Motor Based on Extended Kalman Filter and Markov Chain

Jing Liu, Yanru Zhong, Guoyin Li, 2017, IEEE Transactions on Power Electronics.

A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test

Guoyin Li, Liqun Qi, Haibin Chen, 2018, Numer. Linear Algebra Appl..

Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness

Vaithilingam Jeyakumar, Guoyin Li, T. S. Pham, 2013, Oper. Res. Lett..

Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates

Boris S. Mordukhovich, Guoyin Li, T. T. A. Nghia, 2015, Math. Program..

Robust linear semi-infinite programming duality under uncertainty

Marco A. López, Miguel A. Goberna, Vaithilingam Jeyakumar, 2013, Math. Program..

Exact SDP relaxations for classes of nonlinear semidefinite programming problems

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2012, Oper. Res. Lett..

Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition

Guoyin Li, Guoyin Li, 2012, J. Optim. Theory Appl..

Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2018, SIAM J. Optim..

Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty

Vaithilingam Jeyakumar, Guoyin Li, G. M. Lee, 2015, J. Optim. Theory Appl..

Error bound results for generalized D-gap functions of nonsmooth variational inequality problems

Guoyin Li, Chun-Ming Tang, Zengxin Wei, 2010, J. Comput. Appl. Math..

Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2013, J. Glob. Optim..

An Adaptive Speed Estimation Method Based on a Strong Tracking Extended Kalman Filter with a Least-Square Algorithm for Induction Motors

Jing Liu, Yanru Zhong, Chao Du, 2017 .

New quasi-Newton methods for unconstrained optimization problems

Guoyin Li, Zengxin Wei, Liqun Qi, 2006, Appl. Math. Comput..

Necessary global optimality conditions for nonlinear programming problems with polynomial constraints

Vaithilingam Jeyakumar, Guoyin Li, Guoyin Li, 2011, Math. Program..

Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints

Miguel A. Goberna, Vaithilingam Jeyakumar, Guoyin Li, 2016, Oper. Res. Lett..

On Extension of Fenchel Duality and its Application

Guoyin Li, Kung Fu Ng, 2008, SIAM J. Optim..

The Z‐eigenvalues of a symmetric tensor and its application to spectral hypergraph theory

Guoyin Li, Liqun Qi, Gaohang Yu, 2013, Numer. Linear Algebra Appl..

Strong duality for robust minimax fractional programming problems

Vaithilingam Jeyakumar, Guoyin Li, S. Srisatkunarajah, 2013, Eur. J. Oper. Res..