Browsing by Author He, Bingsheng

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 中
Showing results 1 to 20 of 28  next >
TitleAuthor(s)Issue Date
 
A customized proximal point algorithm for convex minimization with linear constraints
Journal:Computational Optimization and Applications
He, BingshengYuan, XiaomingZhang, Wenxing
2013
 
A hybrid inexact Logarithmic-Quadratic Proximal method for nonlinear complementarity problems
Journal:Journal of Mathematical Analysis and Applications
Xu, YaHe, BingshengYuan, Xiaoming
2006
 
A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0, 2) for separable convex programming
Journal:Mathematics of Computation
He, BingshengMa, FengXu, ShengjieYuan, Xiaoming
1-Jul-2023
 
A splitting method for separable convex programming
Journal:IMA Journal of Numerical Analysis
He, BingshengTao, MinYuan, Xiaoming
2013
 
A strictly contractive Peace man Rachford splitting method for convex programming
Journal:SIAM Journal on Optimization
He, BingshengLiu, HanWang, ZhaoranYuan, Xiaoming
2014
 
A unified framework of some proximal-based decomposition methods for monotone variational inequalities with separable structures
Journal:Pacific Journal of Optimization
He, BingshengYuan, Xiaoming
2012
 
Alternating direction method with Gaussian back substitution for separable convex programming
Journal:SIAM Journal on Optimization
He, BingshengTao, MinYuan, Xiaoming
2012
 
An Accelerated Inexact Proximal Point Algorithm for Convex Minimization
Journal:Journal of Optimization Theory and Applications
He, BingshengYuan, Xiaoming
2012
 
An Algorithmic Framework of Generalized Primal–Dual Hybrid Gradient Methods for Saddle Point Problems
Journal:Journal of Mathematical Imaging and Vision
He, BingshengMa, FengYuan, Xiaoming
2017
 
An alternating direction-based contraction method for linearly constrained separable convex programming problems
Journal:Optimization
He, BingshengTao, MinXu, MinghuaYuan, Xiaoming
2013
 
Comparison of Two Kinds of Prediction-Correction Methods for Monotone Variational Inequalities
Journal:Computational Optimization and Applications
He, BingshengYuan, XiaominoZhang, Jason J.Z.
2004
 
Convergence analysis of primal-dual algorithms for a saddle-point problem: From contraction perspective
Journal:SIAM Journal on Imaging Sciences
He, BingshengYuan, Xiaoming
2012
 
Convergence rate analysis for the alternating direction method of multipliers with a substitution procedure for separable convex programming
Journal:Mathematics of Operations Research
He, BingshengTao, MinYuan, Xiaoming
2017
 
Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: A unified approach
Journal:Computational Optimization and Applications
Gu, GuoyongHe, BingshengYuan, Xiaoming
2014
 
Forward-backward-based descent methods for composite variational inequalities
Proceeding/Conference:Optimization Methods and Software
He, BingshengYuan, Xiaoming
2013
 
Generalized alternating direction method of multipliers: new theoretical insights and applications
Journal:Mathematical Programming Computation
Fang, Ethan X.He, BingshengLiu, HanYuan, Xiaoming
2015
 
Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming
Journal:Numerical Algebra, Control and Optimization
He, BingshengYuan, Xiaoming
2013
 
Matrix completion via an alternating direction method
Journal:IMA Journal of Numerical Analysis
Chen, CaihuaHe, BingshengYuan, Xiaoming
2012
 
On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming
Journal:SIAM Journal on Optimization
He, BingshengHou, LiushengYuan, Xiaoming
2015
 
On non-ergodic convergence rate of Douglas–Rachford alternating direction method of multipliers
Journal:Numerische Mathematik
He, BingshengYuan, Xiaoming
2015
Showing results 1 to 20 of 28  next >