ABSTRACT: In this paper, we investigate the convergence of the generalized Bregman alternating direction method of multipliers (ADMM) for solving nonconvex separable problems with linear constraints.

Pull requests help you collaborate on code with other people. As pull requests are created, they’ll appear here in a searchable and filterable list. To get started, you should create a pull request.

Add a description, image, and links to the recursive-descent topic page so that developers can more easily learn about it.

Abstract: This paper proposes a new policy text similarity calculation method after the analysis and research of the domestic and foreign traditional text similarity calculation based on vector space ...

Abstract: The optimal minimax solution to the N segment piecewise linear approximation of arbitrary convex differentiable functions over a finite range is described. The optimal solution is uniquely ...