Guoyin Li
Orcid: 0000-0002-2099-7974Affiliations:
- University of New South Wales, Department of Applied Mathematics, Australia
According to our database1,
Guoyin Li
authored at least 80 papers
between 2006 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2023
A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems.
Numer. Algorithms, December, 2023
Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints.
Adv. Comput. Math., February, 2023
Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems.
SIAM J. Optim., 2023
2022
Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs.
Math. Oper. Res., 2022
Robust Optimization and Data Classification for Characterization of Huntington Disease Onset via Duality Methods.
J. Optim. Theory Appl., 2022
J. Optim. Theory Appl., 2022
The radius of robust feasibility of uncertain mathematical programs: A Survey and recent developments.
Eur. J. Oper. Res., 2022
2021
Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules.
Optim. Lett., 2021
Calculating Radius of Robust Feasibility of Uncertain Linear Conic Programs via Semi-definite Programs.
J. Optim. Theory Appl., 2021
On the Linear Convergence of Forward-Backward Splitting Method: Part I - Convergence Analysis.
J. Optim. Theory Appl., 2021
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., 2021
Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: Exact second-order cone program reformulations.
EURO J. Comput. Optim., 2021
Comput. Optim. Appl., 2021
2020
Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality.
Eur. J. Oper. Res., 2020
2019
A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints.
Oper. Res. Lett., 2019
A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs.
J. Glob. Optim., 2019
2018
Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems.
SIAM J. Optim., 2018
Convergence rate analysis for the higher order power method in best rank one approximations of tensors.
Numerische Mathematik, 2018
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., 2018
Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates.
Math. Program., 2018
Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations.
J. Glob. Optim., 2018
Calculus of the Exponent of Kurdyka-Łojasiewicz Inequality and Its Applications to Linear Convergence of First-Order Methods.
Found. Comput. Math., 2018
Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs.
Eur. J. Oper. Res., 2018
Constraint qualifications for convex optimization without convexity of constraints : New connections and applications to best approximation.
Eur. J. Oper. Res., 2018
2017
Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems.
SIAM J. Optim., 2017
A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems.
Oper. Res. Lett., 2017
Math. Program., 2017
J. Optim. Theory Appl., 2017
Comput. Optim. Appl., 2017
2016
Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems.
SIAM J. Optim., 2016
Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints.
Oper. Res. Lett., 2016
Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems.
Math. Program., 2016
A Tensor Analogy of Yuan's Theorem of the Alternative and Polynomial Optimization with Sign structure.
J. Optim. Theory Appl., 2016
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets.
J. Glob. Optim., 2016
2015
SIAM J. Optim., 2015
A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs.
Oper. Res. Lett., 2015
Optim. Lett., 2015
New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors.
Math. Program., 2015
J. Optim. Theory Appl., 2015
Eur. J. Oper. Res., 2015
CoRR, 2015
2014
Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty.
SIAM J. Optim., 2014
Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets.
SIAM J. Optim., 2014
Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness.
Oper. Res. Lett., 2014
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization.
Math. Program., 2014
J. Optim. Theory Appl., 2014
Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations.
J. Glob. Optim., 2014
A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs.
J. Comput. Appl. Math., 2014
Comput. Optim. Appl., 2014
2013
The <i>Z</i>-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
Numer. Linear Algebra Appl., 2013
Math. Program., 2013
Finding the Maximum Eigenvalue of Essentially Nonnegative Symmetric Tensors via Sum of Squares Programming.
J. Optim. Theory Appl., 2013
Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty.
J. Glob. Optim., 2013
Eur. J. Oper. Res., 2013
2012
SIAM J. Optim., 2012
Oper. Res. Lett., 2012
Global Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition.
J. Optim. Theory Appl., 2012
2011
A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty.
Oper. Res. Lett., 2011
Necessary global optimality conditions for nonlinear programming problems with polynomial constraints.
Math. Program., 2011
J. Optim. Theory Appl., 2011
Robust Duality for Fractional Programming Problems with Constraint-Wise Data Uncertainty.
J. Optim. Theory Appl., 2011
Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems.
J. Glob. Optim., 2011
J. Comput. Appl. Math., 2011
2010
On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials.
SIAM J. Optim., 2010
SIAM J. Optim., 2010
Characterizing robust set containments and solutions of uncertain linear programs without qualifications.
Oper. Res. Lett., 2010
Error bound results for generalized D-gap functions of nonsmooth variational inequality problems.
J. Comput. Appl. Math., 2010
Eur. J. Oper. Res., 2010
2009
Error Bounds of Generalized D-Gap Functions for Nonsmooth and Nonmonotone Variational Inequality Problems.
SIAM J. Optim., 2009
Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization.
SIAM J. Optim., 2009
Optim. Lett., 2009
2008
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., 2008
2007
2006
New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems.
Appl. Math. Comput., 2006
Appl. Math. Comput., 2006