3 citations · 3 across the 3 of their papers we have counts for
4 papers
Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem
Xinxin Li, Yudong Wei, Hao Zhang
We study the two-set feasibility problem of finding a point in the intersection of closed convex sets in a Hilbert space. We propose a generalized composed alternating re…
A New Adaptive Balanced Augmented Lagrangian Method with Application to ISAC Beamforming Design
Jiageng Wu, Bo Jiang, Xinxin Li +2
In this paper, we consider a class of convex programming problems with linear equality constraints, which finds broad applications in machine learning and signal processing. We pro…
A Semismooth Newton-Type Method for the Nearest Doubly Stochastic Matrix Problem
Hao Hu, Haesol Im, Xinxin Li +1
We study a semismooth Newton-type method for the nearest doubly stochastic matrix problem where both differentiability and nonsingularity of the Jacobian can fail. The optimality c…
A Restricted Dual Peaceman-Rachford Splitting Method for QAP
Naomi Graham, Hao Hu, Haesol Im +2
We revisit and strengthen splitting methods for solving doubly nonnegative, DNN, relaxations of the quadratic assignment problem, QAP. We use a modified restricted contractive spli…