Xiaoming Yuan
Orcid: 0000-0002-6900-6983Affiliations:
- University of Hong Kong, Department of Mathematics, China
- Hong Kong Baptist University, Department of Mathematics, China
According to our database1,
Xiaoming Yuan
authored at least 83 papers
between 2004 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2023
Difference of convex algorithms for bilevel programs with applications in hyperparameter selection.
Math. Program., April, 2023
Math. Program., March, 2023
A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming.
Math. Comput., February, 2023
IEEE Trans. Pattern Anal. Mach. Intell., 2023
2022
A Generalized Primal-Dual Algorithm with Improved Convergence Condition for Saddle Point Problems.
SIAM J. Imaging Sci., September, 2022
IEEE Trans. Image Process., 2022
J. Math. Imaging Vis., 2022
2021
CoRR, 2021
Proceedings of the 38th International Conference on Machine Learning, 2021
2020
Discerning the Linear Convergence of ADMM for Structured Convex Optimization through the Lens of Variational Analysis.
J. Mach. Learn. Res., 2020
Optimally linearizing the alternating direction method of multipliers for convex programming.
Comput. Optim. Appl., 2020
A Generic First-Order Algorithmic Framework for Bi-Level Programming Beyond Lower-Level Singleton.
Proceedings of the 37th International Conference on Machine Learning, 2020
2019
2018
Partial Error Bound Conditions and the Linear Convergence Rate of the Alternating Direction Method of Multipliers.
SIAM J. Numer. Anal., 2018
Convergence Analysis of Primal-Dual Based Methods for Total Variation Minimization with Finite Element Approximation.
J. Sci. Comput., 2018
J. Sci. Comput., 2018
J. Optim. Theory Appl., 2018
Neurocomputing, 2018
The generalized proximal point algorithm with step size 2 is not necessarily convergent.
Comput. Optim. Appl., 2018
Comput. Optim. Appl., 2018
Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization.
Adv. Comput. Math., 2018
2017
Primal-dual hybrid gradient method for distributionally robust optimization problems.
Oper. Res. Lett., 2017
Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming.
Math. Oper. Res., 2017
On the Iteration Complexity of Some Projection Methods for Monotone Linear Variational Inequalities.
J. Optim. Theory Appl., 2017
An Algorithmic Framework of Generalized Primal-Dual Hybrid Gradient Methods for Saddle Point Problems.
J. Math. Imaging Vis., 2017
On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function.
Comput. Optim. Appl., 2017
2016
SIAM J. Imaging Sci., 2016
The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent.
Math. Program., 2016
On the Proximal Jacobian Decomposition of ALM for Multiple-Block Separable Convex Minimization Problems and Its Relationship to ADMM.
J. Sci. Comput., 2016
2015
On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming.
SIAM J. Optim., 2015
A Proximal Strictly Contractive Peaceman-Rachford Splitting Method for Convex Programming with Applications to Imaging.
SIAM J. Imaging Sci., 2015
On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers.
Numerische Mathematik, 2015
Median filtering-based methods for static background extraction from surveillance video.
Numer. Linear Algebra Appl., 2015
Total variation based tensor decomposition for multi-dimensional data with time dimension.
Numer. Linear Algebra Appl., 2015
Generalized alternating direction method of multipliers: new theoretical insights and applications.
Math. Program. Comput., 2015
Math. Program., 2015
A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming.
Math. Oper. Res., 2015
Convergence Analysis of the Generalized Alternating Direction Method of Multipliers with Logarithmic-Quadratic Proximal Regularization.
J. Optim. Theory Appl., 2015
Further Study on the Convergence Rate of Alternating Direction Method of Multipliers with Logarithmic-quadratic Proximal Regularization.
J. Optim. Theory Appl., 2015
2014
IEEE Trans Autom. Sci. Eng., 2014
SIAM J. Optim., 2014
SIAM J. Optim., 2014
SIAM J. Imaging Sci., 2014
A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints.
Numerische Mathematik, 2014
Math. Program., 2014
An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing.
Math. Comput., 2014
Linearized alternating direction method of multipliers for sparse group and fused LASSO models.
Comput. Stat. Data Anal., 2014
Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach.
Comput. Optim. Appl., 2014
2013
IEEE Trans. Signal Process., 2013
Coupled Variational Image Decomposition and Restoration Model for Blurred Cartoon-Plus-Texture Images With Missing Pixels.
IEEE Trans. Image Process., 2013
Constrained Total Variation Deblurring Models and Fast Algorithms Based on Alternating Direction Method of Multipliers.
SIAM J. Imaging Sci., 2013
Optim. Methods Softw., 2013
Math. Program., 2013
Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization.
Math. Comput., 2013
Inexact Alternating Direction Methods of Multipliers with Logarithmic-Quadratic Proximal Regularization.
J. Optim. Theory Appl., 2013
A customized proximal point algorithm for convex minimization with linear constraints.
Comput. Optim. Appl., 2013
Comput. Optim. Appl., 2013
2012
SIAM J. Numer. Anal., 2012
On the O(1/t) Convergence Rate of Alternating Direction Method with Logarithmic-Quadratic Proximal Regularization.
SIAM J. Optim., 2012
Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming.
SIAM J. Optim., 2012
Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective.
SIAM J. Imaging Sci., 2012
J. Optim. Theory Appl., 2012
J. Optim. Theory Appl., 2012
A multi-block alternating direction method with parallel splitting for decentralized consensus optimization.
EURASIP J. Wirel. Commun. Netw., 2012
An efficient simultaneous method for the constrained multiple-sets split feasibility problem.
Comput. Optim. Appl., 2012
An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures.
Comput. Optim. Appl., 2012
A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand.
Comput. Optim. Appl., 2012
2011
Solving Large-Scale Least Squares Semidefinite Programming by Alternating Direction Methods.
SIAM J. Matrix Anal. Appl., 2011
SIAM J. Optim., 2011
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations.
SIAM J. Optim., 2011
SIAM J. Imaging Sci., 2011
Fast minimization methods for solving constrained total-variation superresolution image reconstruction.
Multidimens. Syst. Signal Process., 2011
An improved proximal alternating direction method for monotone variational inequalities with separable structure.
Comput. Optim. Appl., 2011
2010
Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods.
SIAM J. Sci. Comput., 2010
The efficiency analysis for oligopolistic games when cost functions are non-separable.
Int. J. Math. Model. Numer. Optimisation, 2010
2009
2006
A Logarithmic-Quadratic Proximal Prediction-Correction Method for Structured Monotone Variational Inequalities.
Comput. Optim. Appl., 2006
2004
Comparison of Two Kinds of Prediction-Correction Methods for Monotone Variational Inequalities.
Comput. Optim. Appl., 2004