activity
20112019
collaborators

6 papers

math.OC2019

First-order primal-dual algorithm with correction

Xiaokai Chang, Sanyang Liu

This paper is devoted to the design of efficient primal-dual algorithm (PDA) for solving convex optimization problems with known saddle-point structure. We present a new PDA with l…

math.OC2018

Proximal extrapolated gradient methods with prediction and correction for monotone variational inequalities

Xiaokai Chang, Sanyang Liu, Jianchao Bai +1

An efficient proximal-gradient-based method, called proximal extrapolated gradient method, is designed for solving monotone variational inequality in Hilbert space. The proposed me…

cs.SI2018

Variational Community Partition with Novel Network Structure Centrality Prior

Yiguang Bai, Sanyang Liu, Ke Yin +1

In this paper, we proposed a novel two-stage optimization method for network community partition, which is based on inherent network structure information. The introduced optimizat…

math.OC2018

A three-operator splitting perspective of a three-block ADMM for convex quadratic semidefinite programming and extensions

Xiaokai Chang, Liang Chen, Sanyang Liu

In recent years, several convergent multi-block variants of the alternating direction method of multipliers (ADMM) have been proposed for solving the convex quadratic semidefinite…

cs.LO2011

The countable versus uncountable branching recurrences in computability logic

Wenyan Xu, Sanyang Liu

This paper introduces a new simplified version of the countable branching recurrence of Computability Logic, proves its equivalence to the old one, and shows that the basic logic i…

cs.LO2011

Soundness and completeness of the cirquent calculus system CL6 for computability logic

Wenyan Xu, Sanyang Liu

Computability logic is a formal theory of computability. The earlier article "Introduction to cirquent calculus and abstract resource semantics" by Japaridze proved soundness and c…