Convergence error analysis of reflected gradient Langevin dynamics for non-convex constrained optimization
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
Convergence error analysis of reflected gradient Langevin dynamics for non-convex constrained optimization ; day:20 ; month:8 ; year:2024 ; pages:1-25
Japan journal of industrial and applied mathematics ; (20.8.2024), 1-25
- Creator
-
Sato, Kanji
Takeda, Akiko
Kawai, Reiichiro
Suzuki, Taiji
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s13160-024-00667-1
- URN
-
urn:nbn:de:101:1-2411110941347.724419691829
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:32 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
- Sato, Kanji
- Takeda, Akiko
- Kawai, Reiichiro
- Suzuki, Taiji
- SpringerLink (Online service)
Other Objects (12)
Interplay of non-convex quadratically constrained problems with adjustable robust optimization
Non-convex scenario optimization
Representation of non-convex time intervals and propagation of non-convex relations
Representation of non-convex time intervals and propagation of non-convex relations
Control constrained optimal control problems in non-convex three dimensional polyhedral domains
Lagrangian Methods for Constrained Non-Convex Minimizations and Applications in Fracture Mechanics
Pricing in Non-Convex Markets
Non-convex nested Benders decomposition
On convergence of a q-random coordinate constrained algorithm for non-convex problems
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II
Homogenization in non-convex Hencky plasticity and the limit of vanishing hardening in Hencky plasticity with non-convex potentials
Interplay of non-convex quadratically constrained problems with adjustable robust optimization
Non-convex scenario optimization
Representation of non-convex time intervals and propagation of non-convex relations
Representation of non-convex time intervals and propagation of non-convex relations
Control constrained optimal control problems in non-convex three dimensional polyhedral domains
Lagrangian Methods for Constrained Non-Convex Minimizations and Applications in Fracture Mechanics
Pricing in Non-Convex Markets
Non-convex nested Benders decomposition
On convergence of a q-random coordinate constrained algorithm for non-convex problems
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II
Homogenization in non-convex Hencky plasticity and the limit of vanishing hardening in Hencky plasticity with non-convex potentials
Interplay of non-convex quadratically constrained problems with adjustable robust optimization
Non-convex scenario optimization
Representation of non-convex time intervals and propagation of non-convex relations
Representation of non-convex time intervals and propagation of non-convex relations
Control constrained optimal control problems in non-convex three dimensional polyhedral domains
Lagrangian Methods for Constrained Non-Convex Minimizations and Applications in Fracture Mechanics
Pricing in Non-Convex Markets
Non-convex nested Benders decomposition
On convergence of a q-random coordinate constrained algorithm for non-convex problems
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I
Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II