The following pages link to Junfeng Yang (Q247032):
Displaying 40 items.
- (Q341321) (redirect page) (← links)
- Applications of gauge duality in robust principal component analysis and semidefinite programming (Q341322) (← links)
- Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization (Q467471) (← links)
- Alternating algorithms for total variation image reconstruction from random projections (Q695456) (← links)
- Dynamic power price problem: An inverse variational inequality approach (Q1008775) (← links)
- A golden ratio primal-dual algorithm for structured convex optimization (Q2025858) (← links)
- On \(\tau\) matrix-based approximate inverse preconditioning technique for diagonal-plus-Toeplitz linear systems from spatial fractional diffusion equations (Q2075984) (← links)
- GRPDA revisited: relaxed condition and connection to Chambolle-Pock's primal-dual algorithm (Q2103452) (← links)
- Local linear convergence of an ADMM-type splitting framework for equality constrained optimization (Q2240104) (← links)
- A unified and tight linear convergence analysis of the relaxed proximal point algorithm (Q2691350) (← links)
- A hybrid alternating minimization algorithm for structured convex optimization problems with application in Poissonian image processing (Q2691434) (← links)
- Reducing crash recoverability to reachability (Q2828248) (← links)
- A Proximal Point Algorithm for Log-Determinant Optimization with Group Lasso Regularization (Q2848177) (← links)
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing (Q3095057) (← links)
- Alternating Direction Method for Image Inpainting in Wavelet Domains (Q3113791) (← links)
- (Q3176078) (← links)
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction (Q3183365) (← links)
- A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration (Q3183398) (← links)
- Tight Sublinear Convergence Rate of the Proximal Point Algorithm for Maximal Monotone Inclusion Problems (Q3300773) (← links)
- A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem (Q3449576) (← links)
- Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization (Q3454490) (← links)
- A Comparison of Different Contraction Methods for Monotone Variational Inequalities (Q3572309) (← links)
- An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise (Q3581071) (← links)
- A TVSCAD approach for image deblurring with impulsive noise (Q4601428) (← links)
- (Q4908856) (← links)
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization (Q4911905) (← links)
- (Q5070423) (← links)
- Golden Ratio Primal-Dual Algorithm with Linesearch (Q5093645) (← links)
- (Q5390331) (← links)
- (Q5885133) (← links)
- A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA (Q5963317) (← links)
- A golden ratio proximal alternating direction method of multipliers for separable convex optimization (Q6064037) (← links)
- Golden ratio proximal gradient ADMM for distributed composite convex optimization (Q6192034) (← links)
- AdaBB: Adaptive Barzilai-Borwein Method for Convex Optimization (Q6517514) (← links)
- A convex combination based primal-dual algorithm with linesearch for general convex-concave saddle point problems (Q6517552) (← links)
- A note on progressive hedging algorithm for multistage stochastic variational inequalities (Q6540950) (← links)
- Tight ergodic sublinear convergence rate of the relaxed proximal point algorithm for monotone variational inequalities (Q6596341) (← links)
- An extended golden ratio proximal alternating direction method of multipliers for separable convex optimization (Q6665343) (← links)
- A distributed primal-dual hybrid gradient algorithm for fair resource allocation (Q6668156) (← links)
- Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum (Q6748394) (← links)
