- Seminar Calendar
- Seminar Archive
- 2024-2025 Semester 2
- 2024-2025 Semester 1
- 2023-2024 Semester 2
- 2023-2024 Semester 1
- 2022-2023 Semester 2
- 2022-2023 Semester 1
- 2021-2022 Semester 2
- 2021-2022 Semester 1
- 2020-2021 Semester 2
- 2020-2021 Semester 1
- 2019-2020 Semester 2
- 2019-2020 Semester 1
- 2018-2019 Semester 2
- 2018-2019 Semester 1
- 2017-2018 Semester 2
- 2017-2018 Semester 1
- 2016-2017 Semester 2
- 2016-2017 Semester 1
- 2015-2016 Semester 1
- 2015-2016 Semester 2
- 2014-2015 Semester 2
- 2014-2015 Semester 1
- 2013-2014 Semester 2
- 2013-2014 Semester 1
- 2012-2013 Semester 2
- 2012-2013 Semester 1
- 2011-2012 Semester 2
- 2011-2012 Semester 1
- 2010-2011 Semester 2
- 2010-2011 Semester 1
- 2009-2010 Semester 2
- 2009-2010 Semester 1
- 2008-2009 Semester 2
- 2008-2009 Semester 1
- 2007-2008 Semester 2
- 2007-2008 Semester 1
- 2006-2007 Semester 2
- 2006-2007 Semester 1
- 2005-2006 Semester 2
- 2005-2006 Semester 1
- Contact
- Site Map
An efficient sieving based secant method for sparse optimization problems with least-squares constraints
----------------------------------------------------------------------------------------------------
Department of Systems Engineering and Engineering Management
The Chinese University of Hong Kong
----------------------------------------------------------------------------------------------------
Date: Friday, January 26, 4:30 pm – 5:30 pm
Venue: ERB 513, The Chinese University of Hong Kong
Title:An efficient sieving based secant method for sparse optimization problems with least-squares constraints
Speaker: Prof. Yancheng Yuan, Hong Kong Polytechnic University
Abstract:
We propose an efficient sieving based secant method to address the computational challenges of solving sparse optimization problems with least-squares constraints. A level-set method has been introduced in [X. Li, D.F. Sun, and K.-C. Toh, SIAM J. Optim., 28 (2018), pp. 1842--1866] that solves these problems by using the bisection method to find a root of a univariate nonsmooth equation φ(λ)=ϱ for some ϱ>0, where φ(⋅) is the value function computed by a solution of the corresponding regularized least-squares optimization problem. When the objective function in the constrained problem is a polyhedral gauge function, we prove that (i) for any positive integer k, φ(⋅) is piecewise C^k in an open interval containing the solution λ^* to the equation φ(λ)=ϱ; (ii) the Clarke Jacobian of φ(⋅) is always positive. These results allow us to establish the essential ingredients of the fast convergence rates of the secant method. Moreover, an adaptive sieving technique is incorporated into the secant method to effectively reduce the dimension of the level-set subproblems for computing the value of φ(⋅). The high efficiency of the proposed algorithm is demonstrated by extensive numerical results.
This is a joint work with Qian Li and Defeng Sun.
Biography:
Yancheng Yuan is an assistant professor in the Department of Applied Mathematics at the Hong Kong Polytechnic University. His primary research interests lie in the theoretical and applied aspects of continuous optimization and machine learning. He has published papers in prestigious journals such as the "SIAM Journal on Optimization," "Journal of Machine Learning Research," and "IEEE Transactions on Neural Networks and Learning Systems", as well as presented at top academic conferences in the field of machine learning such as ICML, NeurIPS, and WWW. He has received the Best Paper Award Finalist (WWW 2021).
Everyone is welcome to attend the talk!
SEEM-5202 Website: http://seminar.se.cuhk.edu.hk
Email: seem5202@se.cuhk.edu.hk
Date:
Friday, January 26, 2024 - 16:30