The following pages link to G. Li (Q274078):
Displaying 50 items.
- Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty (Q1941033) (← links)
- Global error bounds for piecewise convex polynomials (Q1942267) (← links)
- Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules (Q1996732) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- On the linear convergence of forward-backward splitting method. I: Convergence analysis (Q2031953) (← links)
- Calculating radius of robust feasibility of uncertain linear conic programs via semi-definite programs (Q2032008) (← links)
- Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity (Q2052413) (← links)
- \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex (Q2057228) (← links)
- Robust optimization and data classification for characterization of Huntington disease onset via duality methods (Q2139276) (← links)
- Kurdyka-Łojasiewicz exponent via inf-projection (Q2162122) (← links)
- The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments (Q2242324) (← links)
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← links)
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations (Q2257075) (← links)
- Characterizing robust solution sets of convex programs under data uncertainty (Q2260682) (← links)
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality (Q2273897) (← links)
- A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty (Q2275574) (← links)
- A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints (Q2294373) (← links)
- A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
- Strong duality for robust minimax fractional programming problems (Q2355075) (← links)
- Unified approach to some geometric results in variational analysis (Q2372176) (← links)
- A new version of the Liu-Storey conjugate gradient method (Q2381321) (← links)
- Pseudo-spectra theory of tensors and tensor polynomial eigenvalue problems (Q2404989) (← links)
- Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates (Q2413090) (← links)
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635) (← links)
- New quasi-Newton methods for unconstrained optimization problems (Q2493696) (← links)
- Robust solutions to multi-objective linear programs with uncertain data (Q2630217) (← links)
- Quadratic growth conditions and uniqueness of optimal solution to Lasso (Q2671439) (← links)
- Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules (Q2677664) (← links)
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints (Q2692792) (← links)
- Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems (Q2796798) (← links)
- Some robust convex programs without a duality gap (Q2841072) (← links)
- Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty (Q2934483) (← links)
- The <i>Z</i> -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory (Q2936746) (← links)
- Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems (Q2954171) (← links)
- Global Optimality Conditions for Classes of Non-convex Multi-objective Quadratic Optimization Problems (Q2995269) (← links)
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems (Q3055065) (← links)
- On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials (Q3058515) (← links)
- Strong Duality in Robust Convex Programming: Complete Characterizations (Q3083336) (← links)
- On Extension of Fenchel Duality and its Application (Q3395029) (← links)
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization (Q3457189) (← links)
- Error Bounds of Generalized D-Gap Functions for Nonsmooth and Nonmonotone Variational Inequality Problems (Q3563900) (← links)
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization (Q3563918) (← links)
- Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems (Q4609471) (← links)
- A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test (Q4637394) (← links)
- Hölder Metric Subregularity with Applications to Proximal Point Method (Q4915182) (← links)
- Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets (Q4979877) (← links)
- Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems (Q5045170) (← links)
- Strong duality in robust semi-definite linear programming under data uncertainty (Q5169452) (← links)
- A new class of alternative theorems for SOS-convex inequalities and robust optimization (Q5175328) (← links)
- New Classes of Positive Semi-Definite Hankel Tensors (Q5360850) (← links)
