报告题目：Dual Newton Proximal Point Algorithm for Solution Paths of the L1-Regularized Logistic Regression

报告人：刘勇进教授 福州大学

报告时间：2022年11月4日星期五上午10:00-12:00

报告地点：腾讯会议ID 928-139-454

摘要：The L1-regularized logistic regression is a widely used statistical model in data classification. Though there are many algorithms for solving this problem in the literature, most of them are adapted to its one-variable equivalence problem and few solve the two-variable problem directly. In this talk, we propose a dual Newton method based proximal point algorithm (PPDNA) to solve the L1-regularized logistic regression problem with bias term. Theoretical results show that the global and asymptotically superlinear local convergence of the PPDNA holds under mild conditions. The computational cost of the semismooth Newton (Ssn) algorithm for solving subproblems in the PPDNA can be effectively reduced by fully exploiting the second-order sparsity of the problem. We also design an adaptive sieving (AS) strategy to generate solution paths for the L1-regularized logistic regression problem, where each subproblem in the AS strategy is solved by the PPDNA. This strategy utilizes active set constraints to reduce the number of variables in the problem, thereby speeding up the PPDNA for solving a series of problems. Numerical experiments demonstrate the superior performance of the PPDNA in comparison with some state-of-the-art algorithms and the efficiency of the AS strategy combined with the PPDNA for generating solution paths.

个人简介：刘勇进，福州大学正规赌足球的软件教授、博士生导师、经理。研究兴趣主要包括：最优化理论、方法与应用，大规模数值计算，统计优化等，研究成果在包括Mathematical Programming (Series A)、SIAM Journal on Optimization、SIAM Journal on Scientific Computing等优化与计算国际顶级学术期刊上发表。主持国家自然科学基金4项（面上项目3项、青年基金1项），主持其他省部级纵向科研项目5项。现任中国运筹学会学术交流委员会委员、中国运筹学会青年工作委员会委员、中国运筹学会数学规划分会理事、中国运筹学会智能工业数据解析与优化分会理事。