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...
Main Authors: | Chai, Woon Huei, Ho, Shen-Shyang, Quek, Hiok Chai |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/161093 |
Similar Items
-
Diagonal quasi-newton's method for large-scale systems of nonlinear equations
by: Yusuf, Mohammed Waziri
Published: (2011) -
Preconditioning Subspace Quasi-Newton Method for Large Scale Unconstrained Optimization
by: Sim, Hong Sen
Published: (2011) -
Quasi-Newton type method via weak secant equations for unconstrained optimization
by: Lim, Keat Hee
Published: (2021) -
New Quasi-Newton Equation And Method Via Higher Order Tensor Models
by: Gholilou, Fahimeh Biglari
Published: (2010) -
Representation recovery via L₁-norm minimization with corrupted data
by: Chai, Woon Huei, et al.
Published: (2022)