The following pages link to Min Li (Q447562):
Displaying 37 items.
- Modified halfspace-relaxation projection methods for solving the split feasibility problem (Q447563) (← links)
- (Q495736) (redirect page) (← links)
- Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization (Q495737) (← links)
- An LQP-based descent method for structured monotone variational inequalities (Q609244) (← links)
- Some Goldstein's type methods for co-coercive variant variational inequalities (Q617635) (← links)
- (Q835792) (redirect page) (← links)
- Neural networks for a class of bi-level variational inequalities (Q835793) (← links)
- The charges on the paths (Q856107) (← links)
- A modified inexact operator splitting method for monotone variational inequalities (Q934787) (← links)
- An improved proximal-based decomposition method for structured monotone variational inequalities (Q940504) (← links)
- A modified inexact implicit method for mixed variational inequalities (Q989142) (← links)
- Proximal point algorithms for general variational inequalities (Q1035903) (← links)
- A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming (Q1716951) (← links)
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights (Q1717220) (← links)
- Prediction-correction alternating direction method for a class of constrained min-max problems (Q1956529) (← links)
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems (Q2022322) (← links)
- Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization (Q2260661) (← links)
- An improved LQP-based method for solving nonlinear complementarity problems (Q2266828) (← links)
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems (Q2275326) (← links)
- An LQP-based symmetric alternating direction method of multipliers with larger step sizes (Q2314067) (← links)
- Convergence analysis of the relaxed proximal point algorithm (Q2319250) (← links)
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems (Q2419543) (← links)
- Inexact alternating direction methods of multipliers with logarithmic-quadratic proximal regularization (Q2435026) (← links)
- On the \(O(1/t)\) convergence rate of the LQP prediction-correction method (Q2439520) (← links)
- The PPA-based numerical algorithm with the \(O(1/t)\) convergence rate for variant variational inequalities (Q2448215) (← links)
- An APPA-based descent method with optimal step-sizes for monotone variational inequalities (Q2462142) (← links)
- A new generalized APPA for maximal monotone operators (Q2469710) (← links)
- Comparison of two proximal point algorithms for monotone variational inequalities (Q2469901) (← links)
- An improved Goldstein's type method for a class of variant variational inequalities (Q2479389) (← links)
- A modified descent method for co-coercive variational inequalities (Q2480969) (← links)
- (Q2793028) (← links)
- A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization (Q2802143) (← links)
- Some proximal algorithms for linearly constrained general variational inequalities (Q2903137) (← links)
- A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block (Q2948891) (← links)
- An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities (Q3225232) (← links)
- (Q3434038) (← links)
- The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming (Q4967363) (← links)
