most citedFeasibility and A Fast Algorithm for Euclidean Distance Matrix Optimization with Ordinal Constraints

5 citations · 5 across the 2 of their papers we have counts for

collaborators
Showing math.NAShow all

1 paper · 1 filter

math.NA2021

Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers

Jianchao Bai, Yuxue Ma, Hao Sun +1

In this paper, we consider a prototypical convex optimization problem with multi-block variables and separable structures. By adding the Logarithmic Quadratic Proximal (LQP) regula…