Liang Chen
Orcid: 0000-0003-0398-4669Affiliations:
- Hunan University, College of Mathematics and Econometrics, Changsha, China
According to our database1,
Liang Chen authored at least 12 papers
between 2017 and 2026.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2026
A Convergent Inexact Abedin-Kitagawa Iteration Method for Monge-Ampère Eigenvalue Problems.
J. Sci. Comput., February, 2026
Characterizations of the Aubin property of the solution mapping for nonlinear semidefinite programming.
Math. Program., January, 2026
A non-intrusive model order reduction method based on nonlinear optimization for parameterized Stokes problems.
J. Comput. Appl. Math., 2026
2025
SIAM J. Sci. Comput., 2025
Aubin Property and Strong Regularity Are Equivalent for Nonlinear Second-Order Cone Programming.
SIAM J. Optim., 2025
2021
On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming.
Math. Program., 2021
2020
On the Convergence Properties of a Second-Order Augmented Lagrangian Method for Nonlinear Programming Problems with Inequality Constraints.
J. Optim. Theory Appl., 2020
The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion.
Asia Pac. J. Oper. Res., 2020
A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond.
Asia Pac. J. Oper. Res., 2020
2018
A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming.
Math. Program. Comput., 2018
2017
An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming.
Math. Program., 2017
A note on the convergence of ADMM for linearly constrained convex optimization problems.
Comput. Optim. Appl., 2017