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 |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/161093 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Eigenvalues and switching algorithms for Quasi-Newton updates
by: Phua, P.K.H.
Published: (2014) -
Nonsmooth multiobjective programming with quasi-Newton methods
by: Qu, S., et al.
Published: (2014) -
Quasi-Newton methods for solving multiobjective optimization
by: Qu, S., et al.
Published: (2013) -
An inexact SQP Newton method for convex SC1 minimization problems
by: CHEN YIDI
Published: (2010) -
Representation recovery via L₁-norm minimization with corrupted data
by: Chai, Woon Huei, et al.
Published: (2022)