On convergence and complexity analysis of an accelerated forward–backward algorithm with linesearch technique for convex minimization problems and applications to data prediction and classification
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1029-242X
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
On convergence and complexity analysis of an accelerated forward–backward algorithm with linesearch technique for convex minimization problems and applications to data prediction and classification ; volume:2021 ; number:1 ; day:21 ; month:8 ; year:2021 ; pages:1-20 ; date:12.2021
Journal of inequalities and applications ; 2021, Heft 1 (21.8.2021), 1-20, 12.2021
- Creator
-
Sarnmeta, Panitarn
Inthakon, Warunun
Chumpungam, Dawan
Suantai, Suthep
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1186/s13660-021-02675-y
- URN
-
urn:nbn:de:101:1-2021110719100570444212
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:28 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Sarnmeta, Panitarn
- Inthakon, Warunun
- Chumpungam, Dawan
- Suantai, Suthep
- SpringerLink (Online service)
Other Objects (12)
An accelerated viscosity forward-backward splitting algorithm with the linesearch process for convex minimization problems
New inertial forward–backward algorithm for convex minimization with applications
Convex minimization and phase field models
Convex analysis and minimization algorithms, 1.. Fundamentals
Convex analysis and minimization algorithms, 1.. Fundamentals
On some accelerated optimization algorithms based on fixed point and linesearch techniques for convex minimization problems with applications
Convex analysis and minimization algorithms, 2.. Advanced theory and bundle methods
Convex analysis and minimization algorithms, 2.. Advanced theory and bundle methods
Extragradient method for convex minimization problem
Dynamical approaches to linearly constrained convex minimization
An intermixed iteration for constrained convex minimization problem and split feasibility problem
The forward–backward splitting methods for variational inequalities and minimization problems in Banach spaces
An accelerated viscosity forward-backward splitting algorithm with the linesearch process for convex minimization problems
New inertial forward–backward algorithm for convex minimization with applications
Convex minimization and phase field models
Convex analysis and minimization algorithms, 1.. Fundamentals
Convex analysis and minimization algorithms, 1.. Fundamentals
On some accelerated optimization algorithms based on fixed point and linesearch techniques for convex minimization problems with applications
Convex analysis and minimization algorithms, 2.. Advanced theory and bundle methods
Convex analysis and minimization algorithms, 2.. Advanced theory and bundle methods
Extragradient method for convex minimization problem
Dynamical approaches to linearly constrained convex minimization
An intermixed iteration for constrained convex minimization problem and split feasibility problem
The forward–backward splitting methods for variational inequalities and minimization problems in Banach spaces
An accelerated viscosity forward-backward splitting algorithm with the linesearch process for convex minimization problems
New inertial forward–backward algorithm for convex minimization with applications
Convex minimization and phase field models
Convex analysis and minimization algorithms, 1.. Fundamentals
Convex analysis and minimization algorithms, 1.. Fundamentals
On some accelerated optimization algorithms based on fixed point and linesearch techniques for convex minimization problems with applications
Convex analysis and minimization algorithms, 2.. Advanced theory and bundle methods
Convex analysis and minimization algorithms, 2.. Advanced theory and bundle methods
Extragradient method for convex minimization problem
Dynamical approaches to linearly constrained convex minimization
An intermixed iteration for constrained convex minimization problem and split feasibility problem