Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1029-242X
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem ; volume:2017 ; number:1 ; day:9 ; month:1 ; year:2017 ; pages:1-12 ; date:12.2017
Journal of inequalities and applications ; 2017, Heft 1 (9.1.2017), 1-12, 12.2017
- Klassifikation
-
Informatik
- Urheber
-
Tian, Ming
- Beteiligte Personen und Organisationen
-
Zhang, Hui-fang
SpringerLink (Online service)
- DOI
-
10.1186/s13660-016-1289-4
- URN
-
urn:nbn:de:1111-201702087526
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:58 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
- Tian, Ming
- Zhang, Hui-fang
- SpringerLink (Online service)
Ähnliche Objekte (12)
Dynamical approaches to linearly constrained convex minimization
Iterative approximation of solutions for constrained convex minimization problem
Iterative methods for constrained convex minimization problem in Hilbert spaces
A stochastic moving ball approximation method for smooth convex constrained minimization
An intermixed iteration for constrained convex minimization problem and split feasibility problem
Convex projection and convex multi-objective optimization
Extragradient method for convex minimization problem
Convex minimization and phase field models
Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem
Convex analysis and minimization algorithms, 1.. Fundamentals
Convex analysis and minimization algorithms, 1.. Fundamentals
Distributed block-diagonal approximation methods for regularized empirical risk minimization
Dynamical approaches to linearly constrained convex minimization
Iterative approximation of solutions for constrained convex minimization problem
Iterative methods for constrained convex minimization problem in Hilbert spaces
A stochastic moving ball approximation method for smooth convex constrained minimization
An intermixed iteration for constrained convex minimization problem and split feasibility problem
Convex projection and convex multi-objective optimization
Extragradient method for convex minimization problem
Convex minimization and phase field models
Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem
Convex analysis and minimization algorithms, 1.. Fundamentals
Convex analysis and minimization algorithms, 1.. Fundamentals
Distributed block-diagonal approximation methods for regularized empirical risk minimization
Dynamical approaches to linearly constrained convex minimization
Iterative approximation of solutions for constrained convex minimization problem
Iterative methods for constrained convex minimization problem in Hilbert spaces
A stochastic moving ball approximation method for smooth convex constrained minimization
An intermixed iteration for constrained convex minimization problem and split feasibility problem
Convex projection and convex multi-objective optimization
Extragradient method for convex minimization problem
Convex minimization and phase field models
Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem
Convex analysis and minimization algorithms, 1.. Fundamentals
Convex analysis and minimization algorithms, 1.. Fundamentals