On some accelerated optimization algorithms based on fixed point and linesearch techniques for convex minimization problems with applications
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2731-4235
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
On some accelerated optimization algorithms based on fixed point and linesearch techniques for convex minimization problems with applications ; volume:2022 ; number:1 ; day:17 ; month:3 ; year:2022 ; pages:1-18 ; date:12.2022
Advances in continuous and discrete models ; 2022, Heft 1 (17.3.2022), 1-18, 12.2022
- Urheber
-
Yatakoat, Pornsak
Suantai, Suthep
Hanjing, Adisak
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1186/s13662-022-03698-5
- URN
-
urn:nbn:de:101:1-2022060921445077551150
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:25 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Yatakoat, Pornsak
- Suantai, Suthep
- Hanjing, Adisak
- SpringerLink (Online service)
Ähnliche Objekte (12)
Minimization of quadratic functions on convex sets without asymptotes
Note on minimization of quasi M $$^\natural }$$ ♮ -convex functions
Extragradient method for convex minimization problem
Convex minimization and phase field models
An accelerated viscosity forward-backward splitting algorithm with the linesearch process for convex minimization problems
On robustness properties of convex risk minimization methods for pattern recognition
On Robustness Properties of Convex Risk Minimization Methods for Pattern Recognition
Dynamical approaches to linearly constrained convex minimization
Convex analysis and minimization algorithms, 1.. Fundamentals
Convex analysis and minimization algorithms, 1.. Fundamentals
A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
An Accelerated First-Order Method for Non-convex Optimization on Manifolds
Minimization of quadratic functions on convex sets without asymptotes
Note on minimization of quasi M $$^\natural }$$ ♮ -convex functions
Extragradient method for convex minimization problem
Convex minimization and phase field models
An accelerated viscosity forward-backward splitting algorithm with the linesearch process for convex minimization problems
On robustness properties of convex risk minimization methods for pattern recognition
On Robustness Properties of Convex Risk Minimization Methods for Pattern Recognition
Dynamical approaches to linearly constrained convex minimization
Convex analysis and minimization algorithms, 1.. Fundamentals
Convex analysis and minimization algorithms, 1.. Fundamentals
A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
An Accelerated First-Order Method for Non-convex Optimization on Manifolds
Minimization of quadratic functions on convex sets without asymptotes
Note on minimization of quasi M $$^\natural }$$ ♮ -convex functions
Extragradient method for convex minimization problem
Convex minimization and phase field models
An accelerated viscosity forward-backward splitting algorithm with the linesearch process for convex minimization problems
On robustness properties of convex risk minimization methods for pattern recognition
On Robustness Properties of Convex Risk Minimization Methods for Pattern Recognition
Dynamical approaches to linearly constrained convex minimization
Convex analysis and minimization algorithms, 1.. Fundamentals
Convex analysis and minimization algorithms, 1.. Fundamentals
A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions