Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ AIMS Mathematicsarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
AIMS Mathematics
Article . 2024 . Peer-reviewed
Data sources: Crossref
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
AIMS Mathematics
Article . 2024
Data sources: DOAJ
https://dx.doi.org/10.60692/gr...
Other literature type . 2024
Data sources: Datacite
https://dx.doi.org/10.60692/wk...
Other literature type . 2024
Data sources: Datacite
versions View all 4 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

A recent proximal gradient algorithm for convex minimization problem using double inertial extrapolations

خوارزمية تدرج قريبة حديثة لمشكلة التقليل المحدب باستخدام استقراءات القصور الذاتي المزدوجة
Authors: Suparat Kesornprom; Papatsara Inkrong; Uamporn Witthayarat; Prasit Cholamjiak;

A recent proximal gradient algorithm for convex minimization problem using double inertial extrapolations

Abstract

<abstract><p>In this study, we suggest a new class of forward-backward (FB) algorithms designed to solve convex minimization problems. Our method incorporates a linesearch technique, eliminating the need to choose Lipschitz assumptions explicitly. Additionally, we apply double inertial extrapolations to enhance the algorithm's convergence rate. We establish a weak convergence theorem under some mild conditions. Furthermore, we perform numerical tests, and apply the algorithm to image restoration and data classification as a practical application. The experimental results show our approach's superior performance and effectiveness, surpassing some existing methods in the literature.</p></abstract>

Related Organizations
Keywords

Artificial intelligence, Inverse Problems in Mathematical Physics and Imaging, Convex Optimization, Economics, Inverse Problems, minimization problem, Computational Mechanics, Biomedical Engineering, Geometry, FOS: Medical engineering, Mathematical analysis, Quantum mechanics, Sparse Approximation, inertial extrapolation, Engineering, Compressed Sensing, Convex function, QA1-939, FOS: Mathematics, Image (mathematics), Orthogonal Matching Pursuit, Mathematical Physics, Economic growth, Computer network, forward-backward algorithm, Minification, Physics, Mathematical optimization, Advances in Photoacoustic Imaging and Tomography, Lipschitz continuity, Rate of convergence, Theory and Applications of Compressed Sensing, Computer science, Convex optimization, Regular polygon, Algorithm, Channel (broadcasting), Physical Sciences, Convergence (economics), weak convergence, Inertial frame of reference, Mathematics

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
gold
Related to Research communities