A Proximal Algorithm with Convergence Guarantee for a Nonconvex Minimization Problem Based on Reproducing Kernel Hilbert Space
The underlying function in reproducing kernel Hilbert space (RKHS) may be degraded by outliers or deviations, resulting in a symmetry ill-posed problem. This paper proposes a nonconvex minimization model with <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display...
Main Authors: | Hong-Xia Dou, Liang-Jian Deng |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-12-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/13/12/2393 |
Similar Items
-
Reproducing Kernel Hilbert Space Approach to Multiresponse Smoothing Spline Regression Function
by: Budi Lestari, et al.
Published: (2022-10-01) -
Bregman iterative regularization using model functions for nonconvex nonsmooth optimization
by: Haoxing Yang, et al.
Published: (2022-11-01) -
Convergence of Bregman Multi-Stage Algorithm
by: Chun Huang, et al.
Published: (2019-01-01) -
An Inertial Parametric Douglas–Rachford Splitting Method for Nonconvex Problems
by: Tianle Lu, et al.
Published: (2024-02-01) -
Nonconvex matrix completion with Nesterov’s acceleration
by: Xiao-Bo Jin, et al.
Published: (2018-12-01)