Jingwei Liang

Jingwei Liang

Auto-generated profile, based on publicly available information

Jingwei Liang

School of Mathematical Sciences Institute of Natural Sciences Shanghai Jiao Tong University 200240 Shanghai CHINA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 May 2022 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
JLJingwei Liang
Jingwei Liang
TLTao Luo
Tao Luo
CSCarola-Bibiane Schönlieb
Carola-Bibiane Schönlieb
The “fast iterative shrinkage-thresholding algorithm,” a.k.a. FISTA, is one of the most well known first-order optimization scheme in the literature, as it achieves the worst-case $O(1/k^2)$ optima...

1 January 2021 in SIAM Journal on Imaging Sciences
Verified
Journal Article
Closed access
DDDerek Driggs
Derek Driggs
JTJunqi Tang
Junqi Tang
JLJingwei Liang
Jingwei Liang
MDMike Davies
Mike Davies
CSCarola-Bibiane Schönlieb
Carola-Bibiane Schönlieb
In this work, we introduce a novel stochastic proximal alternating linearized minimization algorithm [J. Bolte, S. Sabach, and M. Teboulle, Math. Program., 146 (2014), pp. 459--494] for solving a c...

17 January 2018 in Optimization
Verified
Journal Article
Open access
JLJingwei Liang
Jingwei Liang
JFJalal Fadili
Jalal Fadili
GPGabriel Peyré
Gabriel Peyré
In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice.

11 April 2019 in Journal of Optimization Theory and Applications
Verified
Journal Article
Open access
PDF file
CMCesare Molinari
Cesare Molinari
JLJingwei Liang
Jingwei Liang
JFJalal Fadili
Jalal Fadili
Over the past decades, operator splitting methods have become ubiquitous for non-smooth optimization owing to their simplicity and efficiency. In this paper, we consider the Forward–Douglas–Rachford splitting method and study both global and local convergence rates of this method. For the global rate, we establish a sublinear convergence rate in terms of a Bregman divergence suitably designed for the objective function. Moreover, when specializing to the Forward–Backward splitting, we prove a stronger convergence rate result for the objective function value. Then locally, based on the assumption that the non-smooth part of the optimization problem is partly smooth, we establish local linear convergence of the method. More precisely, we show that the sequence generated by Forward–Douglas–Rachford first (i) identifies a smooth manifold in a finite number of iteration and then (ii) enters a local linear convergence regime, which is for instance characterized in terms of the structure of the underlying active smooth manifold. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from applicative fields including, for instance, signal/image processing, inverse problems and machine learning.

15 May 2025 in Inverse Problems
Verified
Journal Article
Open access
MEMatthias J Ehrhardt
Matthias J Ehrhardt
ŽKŽeljko Kereta
Željko Kereta
JLJingwei Liang
Jingwei Liang
JTJunqi Tang
Junqi Tang
Stochastic optimisation algorithms are the de facto standard for machine learning with large amounts of data. Handling only a subset of available data in each optimisation step dramatically reduces the per-iteration computational costs, while still ensuring significant progress towards the solution. Driven by the need to solve large-scale optimisation problems as efficiently as possible, the last decade has witnessed an explosion of research in this area. Leveraging the parallels between machine learning and inverse problems has allowed harnessing the power of this research wave for solving inverse problems. In this survey, we provide a comprehensive account of the state-of-the-art in stochastic optimisation from the viewpoint of variational regularisation for inverse problems where the solution is modelled as minimising an objective function. We cover topics such as variance reduction, acceleration and higher-order methods, and compare theoretical results with practical behaviour. We focus on the potential and the challenges for stochastic optimisation that are unique to variational regularisation for inverse imaging problems and are not commonly encountered in machine learning. We conclude the survey with illustrative examples on linear inverse problems in imaging to examine the advantages and disadvantages that this new generation of algorithms brings to the field of inverse problems.

17 March 2022 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
ALA. S. Lewis
A. S. Lewis
JLJingwei Liang
Jingwei Liang
TTTonghua Tian
Tonghua Tian
In optimization, the notion of a partly smooth objective function is powerful for applications in algorithmic convergence and postoptimality analysis, and yet is complex to define. A shift in focus...