Barrier methods based on Jordan–Hilbert algebras for stochastic optimization in spin factors
Infinite-dimensional stochastic second-order cone programming involves minimizing linear functions over intersections of affine linear manifolds with infinite-dimensional second-order cones. However, even though there is a legitimate necessity to explore these methods in general spaces, there is an...
Uložené v:
| Vydané v: | R.A.I.R.O. Recherche opérationnelle Ročník 58; číslo 1; s. 1011 - 1044 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
01.01.2024
|
| ISSN: | 0399-0559, 2804-7303 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | Infinite-dimensional stochastic second-order cone programming involves minimizing linear functions over intersections of affine linear manifolds with infinite-dimensional second-order cones. However, even though there is a legitimate necessity to explore these methods in general spaces, there is an absence of infinite-dimensional counterparts for these methods. In this paper, we present decomposition logarithmic-barrier interior-point methods based on unital Jordan–Hilbert algebras for this class of optimization problems in the infinite-dimensional setting. The results show that the iteration complexity of the proposed algorithms is independent on the choice of Hilbert spaces from which the underlying spin factors are formed, and so it coincides with the best-known complexity obtained by such methods for the finite-dimensional setting. We apply our results to an important problem in stochastic control, namely the two-stage stochastic multi-criteria design problem. We show that the corresponding infinite-dimensional system in this case is a matrix differential Ricatti equation plus a finite-dimensional system, and hence, it can be solved efficiently to find the search direction. |
|---|---|
| ISSN: | 0399-0559 2804-7303 |
| DOI: | 10.1051/ro/2023198 |