On some accelerated optimization algorithms based on fixed point and linesearch techniques for convex minimization problems with applications
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2731-4235
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
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
- Creator
-
Yatakoat, Pornsak
Suantai, Suthep
Hanjing, Adisak
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1186/s13662-022-03698-5
- URN
-
urn:nbn:de:101:1-2022060921445077551150
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 15.08.2025, 7:25 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
- Yatakoat, Pornsak
- Suantai, Suthep
- Hanjing, Adisak
- SpringerLink (Online service)
Other Objects (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