The following pages link to Guoyin Li (Q274078):
Displaying 50 items.
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure (Q274079) (← links)
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
- Positive semi-definiteness of generalized anti-circulant tensors (Q305067) (← links)
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems (Q312683) (← links)
- SOS tensor decomposition: theory and applications (Q345994) (← links)
- Robust linear semi-infinite programming duality under uncertainty (Q353146) (← links)
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization (Q374638) (← links)
- Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming (Q378284) (← links)
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition (Q415403) (← links)
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs (Q425803) (← links)
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty (Q432370) (← links)
- Robust least square semidefinite programming with applications (Q457207) (← links)
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization (Q463723) (← links)
- (Q481040) (redirect page) (← links)
- On polynomial optimization over non-compact semi-algebraic sets (Q481041) (← links)
- Robust duality in parametric convex optimization (Q491220) (← links)
- Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
- A note on alternating projections for ill-posed semidefinite feasibility problems (Q517318) (← links)
- Robust Farkas' lemma for uncertain linear systems with applications (Q548208) (← links)
- New strong duality results for convex programs with separable constraints (Q613429) (← links)
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems (Q620513) (← links)
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints (Q623367) (← links)
- (Q631699) (redirect page) (← links)
- Robust conjugate duality for convex optimization under uncertainty with application to data classification (Q631700) (← links)
- A note on nonconvex minimax theorem with separable homogeneous polynomials (Q637566) (← links)
- Robust duality for generalized convex programming problems under data uncertainty (Q654075) (← links)
- A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
- Robust duality for fractional programming problems with constraint-wise data uncertainty (Q658562) (← links)
- Further results on Cauchy tensors and Hankel tensors (Q668898) (← links)
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
- Farkas' lemma for separable sublinear inequalities without qualifications (Q732779) (← links)
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors (Q747767) (← links)
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs (Q837124) (← links)
- Error bound results for generalized D-gap functions of nonsmooth variational inequality problems (Q848535) (← links)
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems (Q849738) (← links)
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization (Q875393) (← links)
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications (Q974991) (← links)
- On a separation principle for nonconvex sets (Q1005836) (← links)
- Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property (Q1018910) (← links)
- Convergence rate analysis for the higher order power method in best rank one approximations of tensors (Q1616037) (← links)
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169) (← links)
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation (Q1681319) (← links)
- Peaceman-Rachford splitting for a class of nonconvex optimization problems (Q1687318) (← links)
- A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems (Q1728251) (← links)
- Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs (Q1754722) (← links)
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods (Q1785009) (← links)
- A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs (Q1785391) (← links)
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application (Q1931769) (← links)
- Robust best approximation with interpolation constraints under ellipsoidal uncertainty: strong duality and nonsmooth Newton methods (Q1937726) (← links)
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)
