LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

An Algorithm for Solving Common Points of Convex Minimization Problems with Applications

Photo by benjaminzanatta from unsplash

In algorithm development, symmetry plays a vital part in managing optimization problems in scientific models. The aim of this work is to propose a new accelerated method for finding a… Click to show full abstract

In algorithm development, symmetry plays a vital part in managing optimization problems in scientific models. The aim of this work is to propose a new accelerated method for finding a common point of convex minimization problems and then use the fixed point of the forward-backward operator to explain and analyze a weak convergence result of the proposed algorithm in real Hilbert spaces under certain conditions. As applications, we demonstrate the suggested method for solving image inpainting and image restoration problems.

Keywords: common points; algorithm solving; solving common; minimization problems; convex minimization

Journal Title: Symmetry
Year Published: 2022

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.