✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
The numerical implementations in data classification are reported to show its efficiency.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:In this paper, we propose a new proximal gradient method for a convex minimization problem in real Hilbert spaces.
📊
Key Findings & Data:We suggest a new linesearch which does not require the condition of Lipschitz constant and improve conditions of inertial term which speed up performance of convergence.
💡
Conclusion & Impact:The numerical implementations in data classification are reported to show its efficiency.
🔬Design:Araştırma Makalesi
📍Scope:Comprehensive Sample
⚙️Variables:minimization problem · proximal method · linesearch rule
Abstract
In this paper, we propose a new proximal gradient method for a convex minimization problem in real Hilbert spaces. We suggest a new linesearch which does not require the condition of Lipschitz constant and improve conditions of inertial term which speed up performance of convergence. Moreover, we prove the weak convergence of the proposed method under some suitable conditions. The numerical implementations in data classification are reported to show its efficiency.
🔖
Cite This Article
Kesornprom, S., Cholamjiak, P. (2022). A double proximal gradient method with new linesearch for solving convex minimization problem with application to data classification. Results in Nonlinear Analysis, 2022 - Cilt 5, Sayı 4, 412–422. https://doi.org/10.53006/rna.1143531