Optimal control problems with $$L^0(\Omega )$$ L 0 ( Ω ) constraints: maximum principle and proximal gradient method
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2894
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Optimal control problems with $$L^0(\Omega )$$ L 0 ( Ω ) constraints: maximum principle and proximal gradient method ; day:7 ; month:2 ; year:2023 ; pages:1-23
Computational optimization and applications ; (7.2.2023), 1-23
- Urheber
-
Wachsmuth, Daniel
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10589-023-00456-5
- URN
-
urn:nbn:de:101:1-2023041121125609268316
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:56 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
- Wachsmuth, Daniel
- SpringerLink (Online service)
Ähnliche Objekte (12)
Optimal control problems with L0(Ω) constraints: maximum principle and proximal gradient method
A resolution principle for clauses with constraints
A general double-proximal gradient algorithm for d.c. programming
A general double-proximal gradient algorithm for d.c. programming
Proximal Gradient Algorithms Under Local Lipschitz Gradient Continuity : A Convergence and Robustness Analysis of PANOC
Deterministic Mechanisms, the Revelation Principle, and Ex-Post Constraints
A maximum principle for control problems with monotonicity constraints
Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces
Efficient proximal gradient algorithm for inference of differential gene networks
Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces
New inertial proximal gradient methods for unconstrained convex optimization problems
Convergence Properties of Monotone and Nonmonotone Proximal Gradient Methods Revisited
Optimal control problems with L0(Ω) constraints: maximum principle and proximal gradient method
A resolution principle for clauses with constraints
A general double-proximal gradient algorithm for d.c. programming
A general double-proximal gradient algorithm for d.c. programming
Proximal Gradient Algorithms Under Local Lipschitz Gradient Continuity : A Convergence and Robustness Analysis of PANOC
Deterministic Mechanisms, the Revelation Principle, and Ex-Post Constraints
A maximum principle for control problems with monotonicity constraints
Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces
Efficient proximal gradient algorithm for inference of differential gene networks
Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces
New inertial proximal gradient methods for unconstrained convex optimization problems
Convergence Properties of Monotone and Nonmonotone Proximal Gradient Methods Revisited
Optimal control problems with L0(Ω) constraints: maximum principle and proximal gradient method
A resolution principle for clauses with constraints
A general double-proximal gradient algorithm for d.c. programming
A general double-proximal gradient algorithm for d.c. programming
Proximal Gradient Algorithms Under Local Lipschitz Gradient Continuity : A Convergence and Robustness Analysis of PANOC
Deterministic Mechanisms, the Revelation Principle, and Ex-Post Constraints
A maximum principle for control problems with monotonicity constraints
Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces
Efficient proximal gradient algorithm for inference of differential gene networks
Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces
New inertial proximal gradient methods for unconstrained convex optimization problems