192 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Fudan UniversityCN23 papers
- Shanghai Jiao Tong UniversityCN16 papers
- Peking UniversityCN14 papers
- Chinese University of Hong KongHK11 papers
- Tsinghua UniversityCN10 papers
- University of MinnesotaUS9 papers
- Nanyang Technological UniversitySG8 papers
- Hong Kong University of Science and TechnologyHK7 papers
- University of Hong KongHK7 papers
- University of WashingtonUS7 papers
- Stanford UniversityUS6 papers
- University of Minnesota SystemUS6 papers
5 papers · 2 filters
Auxiliary Problem Principle of augmented Lagrangian with Varying Core Functions for Large-Scale Structured Convex Problems
Lei Zhao, Daoli Zhu, Bo Jiang
The auxiliary problem principle of augmented Lagrangian (APP-AL), proposed by Cohen and Zhu (1984), aims to find the solution of a constrained optimization problem through a sequen…
Dynamic Programming Principle and Associated Hamilton-Jacobi-Bellman Equation for Stochastic Recursive Control Problem with Non-Lipschitz Aggregator
Jiangyan Pu, Qi Zhang
In this work we study the stochastic recursive control problem, in which the aggregator (or called generator) of the backward stochastic differential equation describing the runnin…
Low-M-Rank Tensor Completion and Robust Tensor PCA
Bo Jiang, Shiqian Ma, Shuzhong Zhang
In this paper, we propose a new approach to solve low-rank tensor completion and robust tensor PCA. Our approach is based on some novel notion of (even-order) tensor ranks, to be c…
Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations
Bo Jiang, Zhening Li, Shuzhong Zhang
In this paper we study multivariate polynomial functions in complex variables and the corresponding associated symmetric tensor representations. The focus is on finding conditions…
Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions
Yichen Chen, Dongdong Ge, Mengdi Wang +3
Consider the regularized sparse minimization problem, which involves empirical sums of loss functions for data points (each of dimension ) and a nonconvex sparsity penalty.…