New inertial proximal gradient methods for unconstrained convex optimization problems
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1029-242X
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
New inertial proximal gradient methods for unconstrained convex optimization problems ; volume:2020 ; number:1 ; day:7 ; month:12 ; year:2020 ; pages:1-18 ; date:12.2020
Journal of inequalities and applications ; 2020, Heft 1 (7.12.2020), 1-18, 12.2020
- Creator
-
Duan, Peichao
Zhang, Yiqun
Bu, Qinxiong
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1186/s13660-020-02522-6
- URN
-
urn:nbn:de:101:1-2021011518421902892867
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:34 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
- Duan, Peichao
- Zhang, Yiqun
- Bu, Qinxiong
- SpringerLink (Online service)
Other Objects (12)
An Inertial Proximal-Gradient Penalization Scheme for Constrained Convex Optimization Problems
General inertial proximal stochastic variance reduction gradient for nonconvex nonsmooth optimization
Implementable tensor methods in unconstrained convex optimization
Superfast Second-Order Methods for Unconstrained Convex Optimization
Limited memory gradient methods for unconstrained optimization
A proximal gradient method with double inertial steps for minimization problems involving demicontractive mappings
A Modified Conjugate Gradient Algorithm for Unconstrained Nonlinear Optimization
Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data
A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
A scaled three-term conjugate gradient method for unconstrained optimization
A proximal gradient method for control problems with non-smooth and non-convex control cost
A proximal gradient method for control problems with non-smooth and non-convex control cost
An Inertial Proximal-Gradient Penalization Scheme for Constrained Convex Optimization Problems
General inertial proximal stochastic variance reduction gradient for nonconvex nonsmooth optimization
Implementable tensor methods in unconstrained convex optimization
Superfast Second-Order Methods for Unconstrained Convex Optimization
Limited memory gradient methods for unconstrained optimization
A proximal gradient method with double inertial steps for minimization problems involving demicontractive mappings
A Modified Conjugate Gradient Algorithm for Unconstrained Nonlinear Optimization
Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data
A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
A scaled three-term conjugate gradient method for unconstrained optimization
A proximal gradient method for control problems with non-smooth and non-convex control cost
A proximal gradient method for control problems with non-smooth and non-convex control cost
An Inertial Proximal-Gradient Penalization Scheme for Constrained Convex Optimization Problems
General inertial proximal stochastic variance reduction gradient for nonconvex nonsmooth optimization
Implementable tensor methods in unconstrained convex optimization
Superfast Second-Order Methods for Unconstrained Convex Optimization
Limited memory gradient methods for unconstrained optimization
A proximal gradient method with double inertial steps for minimization problems involving demicontractive mappings
A Modified Conjugate Gradient Algorithm for Unconstrained Nonlinear Optimization
Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data
A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
A scaled three-term conjugate gradient method for unconstrained optimization
A proximal gradient method for control problems with non-smooth and non-convex control cost