CLChong Li
Chong Li
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Chong Li has a total of 56 co-authors. Here are the top co-authors by number of shared publications:
- Jen-Chih Yao
Research Center for Interneural Computing, China Medical University Hospital, China Medical University, Taichung, Taiwan
11 shared publications - Genaro López-Acedo
Department of Mathematical Analysis -IMUS University of Seville 41012 Seville Spain
10 shared publications - Jin-Hua Wang
Zhejiang University of Technology
10 shared publications - Xiao Qi Yang
Department of Applied Mathematics, The Hong Kong Polytechnic University, Kowloon, Hong Kong
8 shared publications - Yaohua Hu
School of Mathematical Sciences, Shenzhen University, Shenzhen, China
7 shared publications - Weiping Shen
School of Mathematical Sciences, Zhejiang Normal University, Jinhua, P. R. China
5 shared publications
Latest Publications
- 25 September 2026
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 94 (3) , 76
Convergence Rates of Subgradient Algorithms for Convex Feasibility Problems
- 25 September 2026
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 94 (3) , 76
Convergence Rates of Subgradient Algorithms for Convex Feasibility Problems
- 18 February 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 208 (3) , 108
Convergence of Linearized Proximal Algorithms with Adaptive Stepsizes for Convex Composite Optimization
- 18 February 2026
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 208 (3) , 108
Convergence of Linearized Proximal Algorithms with Adaptive Stepsizes for Convex Composite Optimization
- 28 June 2023
- Published by Springer Nature in Numerical Algorithms
- Vol. 94 (4) , 1819-1848
Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem
- 28 June 2023
- Published by Springer Nature in Numerical Algorithms
- Vol. 94 (4) , 1819-1848
Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem
- Open Access
Rotation Group Synchronization via Quotient Manifold
Rotation group $\mathcal{SO}(d)$ synchronization is an important inverse problem and has attracted intense attention from numerous application fields such as graph realization, computer vision, and robotics. In this paper, we focus on the least-squares estimator of rotation group synchronization with general additive noise models, which is a nonconvex optimization problem with manifold constraints. Unlike the phase/orthogonal group synchronization, there are limited provable approaches for solving rotation group synchronization. First, we derive improved estimation results of the least-squares/spectral estimator, illustrating the tightness and validating the existing relaxation methods of solving rotation group synchronization through the optimum of relaxed orthogonal group version under near-optimal noise level for exact recovery. Moreover, departing from the standard approach of utilizing the geometry of the ambient Euclidean space, we adopt an intrinsic Riemannian approach to study orthogonal/rotation group synchronization. Benefiting from a quotient geometric view, we prove the positive definite condition of quotient Riemannian Hessian around the optimum of orthogonal group synchronization problem, and consequently the Riemannian local error bound property is established to analyze the convergence rate properties of various Riemannian algorithms. As a simple and feasible method, the sequential convergence guarantee of the (quotient) Riemannian gradient method for solving orthogonal/rotation group synchronization problem is studied, and we derive its global linear convergence rate to the optimum with the spectral initialization. All results are deterministic without any probabilistic model.Open AccessRotation Group Synchronization via Quotient Manifold
Rotation group $\mathcal{SO}(d)$ synchronization is an important inverse problem and has attracted intense attention from numerous application fields such as graph realization, computer vision, and robotics. In this paper, we focus on the least-squares estimator of rotation group synchronization with general additive noise models, which is a nonconvex optimization problem with manifold constraints. Unlike the phase/orthogonal group synchronization, there are limited provable approaches for solving rotation group synchronization. First, we derive improved estimation results of the least-squares/spectral estimator, illustrating the tightness and validating the existing relaxation methods of solving rotation group synchronization through the optimum of relaxed orthogonal group version under near-optimal noise level for exact recovery. Moreover, departing from the standard approach of utilizing the geometry of the ambient Euclidean space, we adopt an intrinsic Riemannian approach to study orthogonal/rotation group synchronization. Benefiting from a quotient geometric view, we prove the positive definite condition of quotient Riemannian Hessian around the optimum of orthogonal group synchronization problem, and consequently the Riemannian local error bound property is established to analyze the convergence rate properties of various Riemannian algorithms. As a simple and feasible method, the sequential convergence guarantee of the (quotient) Riemannian gradient method for solving orthogonal/rotation group synchronization problem is studied, and we derive its global linear convergence rate to the optimum with the spectral initialization. All results are deterministic without any probabilistic model. - 29 May 2023
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 198 (1) , 187-214
Convergence of Inexact Steepest Descent Algorithm for Multiobjective Optimizations on Riemannian Manifolds Without Curvature Constraints
- 29 May 2023
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 198 (1) , 187-214
Convergence of Inexact Steepest Descent Algorithm for Multiobjective Optimizations on Riemannian Manifolds Without Curvature Constraints
- 13 March 2023
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 87 (3) , 1-35
Linearized Proximal Algorithms with Adaptive Stepsizes for Convex Composite Optimization with Applications
- 13 March 2023
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 87 (3) , 1-35
Linearized Proximal Algorithms with Adaptive Stepsizes for Convex Composite Optimization with Applications
- 6 September 2022
- Published by Springer Nature in Journal of Global Optimization
- Vol. 85 (2) , 315-349
Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression
- 6 September 2022
- Published by Springer Nature in Journal of Global Optimization
- Vol. 85 (2) , 315-349
Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression
- 5 October 2020
- Published by Springer Nature in Journal of Global Optimization
- Vol. 79 (4) , 853-883
Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- 5 October 2020
- Published by Springer Nature in Journal of Global Optimization
- Vol. 79 (4) , 853-883
Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- 11 September 2020
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 30 (1) , 283-303
Error Bounds for Approximate Solutions of Abstract Inequality Systems and Infinite Systems of Inequalities on Banach Spaces
- 11 September 2020
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 30 (1) , 283-303
Error Bounds for Approximate Solutions of Abstract Inequality Systems and Infinite Systems of Inequalities on Banach Spaces
- Open AccessSparse estimation via $\ell_q$ optimization method in high-dimensional linear regressionIn this paper, we discuss the statistical properties of the $\ell_q$ optimization methods $(0<q\leq 1)$, including the $\ell_q$ minimization method and the $\ell_q$ regularization method, for estimating a sparse parameter from noisy observations in high-dimensional linear regression with either a deterministic or random design. For this purpose, we introduce a general $q$-restricted eigenvalue condition (REC) and provide its sufficient conditions in terms of several widely-used regularity conditions such as sparse eigenvalue condition, restricted isometry property, and mutual incoherence property. By virtue of the $q$-REC, we exhibit the stable recovery property of the $\ell_q$ optimization methods for either deterministic or random designs by showing that the $\ell_2$ recovery bound $O(\epsilon^2)$ for the $\ell_q$ minimization method and the oracle inequality and $\ell_2$ recovery bound $O(\lambda^{\frac{2}{2-q}}s)$ for the $\ell_q$ regularization method hold respectively with high probability. The results in this paper are nonasymptotic and only assume the weak $q$-REC. The preliminary numerical results verify the established statistical property and demonstrate the advantages of the $\ell_q$ regularization method over some existing sparse optimization methods.Open AccessSparse estimation via $\ell_q$ optimization method in high-dimensional linear regressionIn this paper, we discuss the statistical properties of the $\ell_q$ optimization methods $(0<q\leq 1)$, including the $\ell_q$ minimization method and the $\ell_q$ regularization method, for estimating a sparse parameter from noisy observations in high-dimensional linear regression with either a deterministic or random design. For this purpose, we introduce a general $q$-restricted eigenvalue condition (REC) and provide its sufficient conditions in terms of several widely-used regularity conditions such as sparse eigenvalue condition, restricted isometry property, and mutual incoherence property. By virtue of the $q$-REC, we exhibit the stable recovery property of the $\ell_q$ optimization methods for either deterministic or random designs by showing that the $\ell_2$ recovery bound $O(\epsilon^2)$ for the $\ell_q$ minimization method and the oracle inequality and $\ell_2$ recovery bound $O(\lambda^{\frac{2}{2-q}}s)$ for the $\ell_q$ regularization method hold respectively with high probability. The results in this paper are nonasymptotic and only assume the weak $q$-REC. The preliminary numerical results verify the established statistical property and demonstrate the advantages of the $\ell_q$ regularization method over some existing sparse optimization methods.