A stochastic moving ball approximation method for smooth convex constrained minimization
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
1 Online-Ressource.
- Sprache
-
Englisch
- Erschienen in
-
A stochastic moving ball approximation method for smooth convex constrained minimization ; volume:89 ; number:3 ; day:7 ; month:10 ; year:2024 ; pages:659-689 ; date:12.2024
Computational optimization and applications ; 89, Heft 3 (7.10.2024), 659-689, 12.2024
- Urheber
-
Singh, Nitesh Kumar
Necoara, Ion
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10589-024-00612-5
- URN
-
urn:nbn:de:101:1-2502040841203.375559874203
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 15.08.2025, 07:21 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
- Singh, Nitesh Kumar
- Necoara, Ion
- 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
An intermixed iteration for constrained convex minimization problem and split feasibility problem
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
Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
Convex analysis and minimization algorithms, 1.. Fundamentals
Convex analysis and minimization algorithms, 1.. Fundamentals
Smooth valuations on convex functions
Minimization of Lipschitzian piecewise smooth objective functions
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
An intermixed iteration for constrained convex minimization problem and split feasibility problem
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
Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
Convex analysis and minimization algorithms, 1.. Fundamentals
Convex analysis and minimization algorithms, 1.. Fundamentals
Smooth valuations on convex functions
Minimization of Lipschitzian piecewise smooth objective functions
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
An intermixed iteration for constrained convex minimization problem and split feasibility problem
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
Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
Convex analysis and minimization algorithms, 1.. Fundamentals
Convex analysis and minimization algorithms, 1.. Fundamentals
Smooth valuations on convex functions