Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Applied Mathematics | en_US |
| dc.contributor.advisor | Sun, Defeng (AMA) | en_US |
| dc.creator | Ma, Chiyu | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/14464 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | en_US |
| dc.rights | All rights reserved | en_US |
| dc.title | A proximal generation based level set method with secant iterations for the least-squares constrained nuclear norm minimization | en_US |
| dcterms.abstract | The least squares constrained nuclear norm minimization is a problem of practical significance but poses computational challenges. Its relevance spans numerous fields, including image processing, recommendation systems, system identification, classification, and clustering, among others. In this thesis, we propose a proximal generation based level set method with secant iterations to address this problem efficiently. | en_US |
| dcterms.abstract | Our approach combines a level set method with secant iterations and proximal generation techniques. The level set method reformulates the problem as a univariate nonlinear equation φ(λ) = ϱ derived from the regularized least squares problems. We employ the secant method for this equation and establish its fast convergence rates, which depend critically on two properties: the nonsingularity of ∂φ(λ) and (strong) semismoothness of φ(λ). We prove the nonsingularity of the Clarke generalized Jacobian for a broader class of univariate functions. For the semismooth analysis, we analyze the γ−order semismoothness through the semialgebraic property and derive a sufficient condition of the strong semismoothness through the implicit function theorem and the Lipschitz homeomorphism of the solution mapping. | en_US |
| dcterms.abstract | For the nuclear norm regularized subproblems within the level set method, we develop a proximal generation method that effectively exploits low-rank structures without compromising convergence. The method employs low-rank decomposition to reduce subproblems' computation. Proximal gradient steps are utilized to generate high-quality initial points for nonconvex problems and guarantee the global convergence simultaneously. | en_US |
| dcterms.abstract | Numerical experiments demonstrate the superior performance of our approach compared to existing methods. These experiments highlight our method's robustness, efficiency, and ability to handle large-scale problems, making it a valuable tool for applications in machine learning, data science, and signal processing where low-rank matrix optimization is prevalent. | en_US |
| dcterms.extent | xviii, 102 pages : color illustrations | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2026 | en_US |
| dcterms.educationalLevel | Ph.D. | en_US |
| dcterms.educationalLevel | All Doctorate | en_US |
| dcterms.accessRights | open access | en_US |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/14464