A novel quasi-Newton method for composite convex minimization
A fast parallelable Jacobi iteration type optimization method for non-smooth convex composite optimization is presented. Traditional gradient-based techniques cannot solve the problem. Smooth approximate functions are attempted to be used as a replacement of those non-smooth terms without compromisi...
Saved in:
Main Authors: | Chai, Woon Huei, Ho, Shen-Shyang, Quek, Hiok Chai |
---|---|
其他作者: | School of Computer Science and Engineering |
格式: | Article |
語言: | English |
出版: |
2022
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/161093 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
Eigenvalues and switching algorithms for Quasi-Newton updates
由: Phua, P.K.H.
出版: (2014) -
Nonsmooth multiobjective programming with quasi-Newton methods
由: Qu, S., et al.
出版: (2014) -
Quasi-Newton methods for solving multiobjective optimization
由: Qu, S., et al.
出版: (2013) -
An inexact SQP Newton method for convex SC1 minimization problems
由: CHEN YIDI
出版: (2010) -
Representation recovery via L₁-norm minimization with corrupted data
由: Chai, Woon Huei, et al.
出版: (2022)