Guoyin Li

From MaRDI portal
Revision as of 02:21, 10 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Guoyin Li to Guoyin Li: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:274078

Available identifiers

zbMath Open li.guoyinWikidataQ57842346 ScholiaQ57842346MaRDI QIDQ274078

List of research outcomes

PublicationDate of PublicationType
Machine learning aided uncertainty quantification for engineering structures involving material-geometric randomness and data imperfection2024-04-29Paper
A full splitting algorithm for fractional programs with structured numerators and denominators2023-12-21Paper
Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: exact second-order cone program reformulations2023-07-12Paper
Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems2023-06-07Paper
Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints2023-03-23Paper
Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules2023-01-05Paper
Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems2022-11-04Paper
Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs2022-09-26Paper
Kurdyka-Łojasiewicz exponent via inf-projection2022-08-05Paper
Quadratic growth conditions and uniqueness of optimal solution to Lasso2022-06-03Paper
Robust optimization and data classification for characterization of Huntington disease onset via duality methods2022-05-17Paper
\(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex2021-12-08Paper
Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity2021-11-26Paper
The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments2021-11-09Paper
Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints2021-06-16Paper
On the linear convergence of forward-backward splitting method. I: Convergence analysis2021-06-15Paper
Calculating radius of robust feasibility of uncertain linear conic programs via semi-definite programs2021-06-15Paper
Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules2021-02-26Paper
A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints2020-02-10Paper
A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs2019-12-03Paper
Efficiently Maximizing a Homogeneous Polynomial over Unit Sphere without Convex Relaxation2019-09-29Paper
Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality2019-09-18Paper
A proximal-projection partial bundle method for convex constrained minimax problems2019-07-23Paper
Further results on Cauchy tensors and Hankel tensors2019-03-19Paper
A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems2019-02-22Paper
Convergence rate analysis for the higher order power method in best rank one approximations of tensors2018-10-31Paper
A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs2018-09-28Paper
Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods2018-09-27Paper
Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness2018-08-27Paper
Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations2018-07-18Paper
On the Q-linear convergence of forward-backward splitting method and uniqueness of optimal solution to Lasso2018-06-17Paper
Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs2018-05-31Paper
A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test2018-04-18Paper
Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates2018-04-06Paper
Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems2018-04-03Paper
Peaceman-Rachford splitting for a class of nonconvex optimization problems2017-12-22Paper
Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation2017-11-23Paper
A Bounded Degree Lasserre Hierarchy with SOCP Relaxations for Global Polynomial Optimization and Applications2017-10-18Paper
New Classes of Positive Semi-Definite Hankel Tensors2017-09-26Paper
Pseudo-spectra theory of tensors and tensor polynomial eigenvalue problems2017-09-21Paper
A note on alternating projections for ill-posed semidefinite feasibility problems2017-03-23Paper
Exact conic programming relaxations for a class of convex polynomial cone programs2017-02-23Paper
Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems2017-01-12Paper
SOS tensor decomposition: theory and applications2016-12-05Paper
Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems2016-09-16Paper
Positive semi-definiteness of generalized anti-circulant tensors2016-08-26Paper
Robust solutions to multi-objective linear programs with uncertain data2016-07-26Paper
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets2016-05-25Paper
A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure2016-04-22Paper
Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems2016-03-30Paper
Global Convergence of Splitting Methods for Nonconvex Composite Optimization2015-12-11Paper
Finding the maximum eigenvalue of a class of tensors with applications in copositivity test and hypergraphs2015-11-07Paper
New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors2015-10-19Paper
Robust duality in parametric convex optimization2015-08-24Paper
Strong duality for robust minimax fractional programming problems2015-07-28Paper
Characterizing robust solution sets of convex programs under data uncertainty2015-03-11Paper
Robust SOS-convex polynomial optimization problems: exact SDP relaxations2015-02-23Paper
A new class of alternative theorems for SOS-convex inequalities and robust optimization2015-02-20Paper
The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory2015-01-06Paper
On polynomial optimization over non-compact semi-algebraic sets2014-12-12Paper
Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty2014-12-12Paper
SOS-Hankel Tensors: Theory and Application2014-10-26Paper
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization2014-10-17Paper
Robust least square semidefinite programming with applications2014-09-26Paper
Support vector machine classifiers with uncertain knowledge sets via robust optimization2014-08-05Paper
A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs2014-07-23Paper
Strong duality in robust semi-definite linear programming under data uncertainty2014-07-10Paper
Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets2014-06-19Paper
Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations2014-04-01Paper
Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming2013-11-11Paper
Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization2013-10-24Paper
https://portal.mardi4nfdi.de/entity/Q28410722013-07-24Paper
Robust linear semi-infinite programming duality under uncertainty2013-07-12Paper
Hölder Metric Subregularity with Applications to Proximal Point Method2013-04-09Paper
Global error bounds for piecewise convex polynomials2013-03-18Paper
Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty2013-03-11Paper
Exact SDP relaxations for classes of nonlinear semidefinite programming problems2013-03-05Paper
Robust best approximation with interpolation constraints under ellipsoidal uncertainty: strong duality and nonsmooth Newton methods2013-03-04Paper
Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application2013-01-16Paper
Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty2012-07-04Paper
New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs2012-06-09Paper
Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition2012-05-08Paper
Robust duality for fractional programming problems with constraint-wise data uncertainty2012-01-12Paper
Robust duality for generalized convex programming problems under data uncertainty2011-12-21Paper
A working set SQCQP algorithm with simple nonmonotone penalty parameters2011-12-21Paper
A note on nonconvex minimax theorem with separable homogeneous polynomials2011-09-06Paper
A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty2011-08-09Paper
Robust Farkas' lemma for uncertain linear systems with applications2011-06-28Paper
Global Optimality Conditions for Classes of Non-convex Multi-objective Quadratic Optimization Problems2011-04-20Paper
Strong Duality in Robust Convex Programming: Complete Characterizations2011-03-21Paper
Robust conjugate duality for convex optimization under uncertainty with application to data classification2011-03-14Paper
Necessary global optimality conditions for nonlinear programming problems with polynomial constraints2011-02-14Paper
Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems2011-01-19Paper
New strong duality results for convex programs with separable constraints2010-12-20Paper
On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials2010-12-03Paper
Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems2010-11-07Paper
Characterizing robust set containments and solutions of uncertain linear programs without qualifications2010-06-08Paper
Error Bounds of Generalized D-Gap Functions for Nonsmooth and Nonmonotone Variational Inequality Problems2010-06-01Paper
Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization2010-06-01Paper
Error bound results for generalized D-gap functions of nonsmooth variational inequality problems2010-03-04Paper
https://portal.mardi4nfdi.de/entity/Q58520662010-01-26Paper
Farkas' lemma for separable sublinear inequalities without qualifications2009-10-15Paper
Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs2009-09-10Paper
On Extension of Fenchel Duality and its Application2009-08-20Paper
Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property2009-05-26Paper
On a separation principle for nonconvex sets2009-03-16Paper
A new version of the Liu-Storey conjugate gradient method2007-09-17Paper
Unified approach to some geometric results in variational analysis2007-07-25Paper
New conjugacy condition and related new conjugate gradient methods for unconstrained optimization2007-04-13Paper
New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems2006-10-31Paper
New quasi-Newton methods for unconstrained optimization problems2006-06-16Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Guoyin Li