The following pages link to Xiao-Ming Yuan (Q632176):
Displaying 50 items.
- (Q245471) (redirect page) (← links)
- The GUS-property of second-order cone linear complementarity problems (Q378127) (← links)
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand (Q429526) (← links)
- An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures (Q453611) (← links)
- Computing the nearest Euclidean distance matrix with low embedding dimensions (Q463737) (← links)
- A phase model for point spread function estimation in ground-based astronomy (Q476541) (← links)
- Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization (Q495737) (← links)
- Solving over-production and supply-guarantee problems in economic equilibria (Q539103) (← links)
- An improved proximal alternating direction method for monotone variational inequalities with separable structure (Q540633) (← links)
- Existence of anonymous link tolls for decentralizing an oligopolistic game and the efficiency analysis (Q549892) (← links)
- Some Goldstein's type methods for co-coercive variant variational inequalities (Q617635) (← links)
- Fast minimization methods for solving constrained total-variation superresolution image reconstruction (Q632177) (← links)
- An efficient simultaneous method for the constrained multiple-sets split feasibility problem (Q694525) (← links)
- Alternating algorithms for total variation image reconstruction from random projections (Q695456) (← links)
- (Q703661) (redirect page) (← links)
- An approximate proximal-extragradient type method for monotone variational inequalities (Q703662) (← links)
- A class of ADMM-based algorithms for three-block separable convex programming (Q721954) (← links)
- The generalized proximal point algorithm with step size 2 is not necessarily convergent (Q721955) (← links)
- Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization (Q723737) (← links)
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach (Q742299) (← links)
- On the convergence rate of Douglas-Rachford operator splitting method (Q747781) (← links)
- The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities (Q815484) (← links)
- The prediction-correction approach to nonlinear complementarity problems (Q853010) (← links)
- An improved extra-gradient method for minimizing a sum of \(p\)-norms -- a variational inequality approach (Q853553) (← links)
- A logarithmic-quadratic proximal prediction-correction method for structured monotone variational inequalities (Q853670) (← links)
- An improved proximal-based decomposition method for structured monotone variational inequalities (Q940504) (← links)
- The efficiency analysis for oligopolistic games when cost functions are non-separable (Q964141) (← links)
- A practical trial-and-error implementation of marginal-cost pricing on networks (Q974717) (← links)
- Bregman distances and Klee sets (Q1028402) (← links)
- Bregman distances and Chebyshev sets (Q1029105) (← links)
- Proximal point algorithms for general variational inequalities (Q1035903) (← links)
- Comparison of two kinds of prediction-correction methods for monotone variational inequalities (Q1430272) (← links)
- Linearized alternating direction method of multipliers for sparse group and fused Lasso models (Q1623671) (← links)
- Convergence analysis of primal-dual based methods for total variation minimization with finite element approximation (Q1668721) (← links)
- An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems (Q1702597) (← links)
- Primal-dual hybrid gradient method for distributionally robust optimization problems (Q1728370) (← links)
- On Glowinski's open question on the alternating direction method of multipliers (Q1730806) (← links)
- On the optimal linear convergence rate of a generalized proximal point algorithm (Q1742669) (← links)
- A note on the alternating direction method of multipliers (Q1934619) (← links)
- An accelerated inexact proximal point algorithm for convex minimization (Q1937079) (← links)
- An ADM-based splitting method for separable convex programming (Q1946622) (← links)
- Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming (Q1953150) (← links)
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400) (← links)
- On the optimal proximal parameter of an ADMM-like splitting method for separable convex programming (Q2073353) (← links)
- On convergence of the Arrow-Hurwicz method for saddle point problems (Q2103873) (← links)
- Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis (Q2116020) (← links)
- The springback penalty for robust signal recovery (Q2168687) (← links)
- Stochastic AUC optimization with general loss (Q2191849) (← 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)
