Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2512.10290 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917138046910464 |
|---|---|
| author | Morzhin, Oleg V. |
| author_facet | Morzhin, Oleg V. |
| contents | This article (II) continues the research described in [Morzhin O.V. Gradient projection method and stochastic search for some optimal control models with spin chains. I (submitted)] (Article I), derives the needed finite-dimensional gradients corresponding to the infinite-dimensional gradients obtained in Article I, both for transfer and keeping problems at a certain $N$-dimensional spin chain, and correspondingly adapts a projection-type condition for optimality, gradient projection method (GPM). For the case $N=3$, the given in this article examples together with Example 3 in Article I show that: a) the adapted GPM and genetic algorithm (GA) successfully solved numerically the considered transfer and keeping problems; b) the two- and three-step GPM forms significantly surpass the one-step GPM. Moreover, GA and a special class of controls were successfully used in such the transfer problem that $N=20$ and the final time is not assigned. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_10290 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Gradient projection method and stochastic search for some optimal control models with spin chains. II Morzhin, Oleg V. Quantum Physics Optimization and Control This article (II) continues the research described in [Morzhin O.V. Gradient projection method and stochastic search for some optimal control models with spin chains. I (submitted)] (Article I), derives the needed finite-dimensional gradients corresponding to the infinite-dimensional gradients obtained in Article I, both for transfer and keeping problems at a certain $N$-dimensional spin chain, and correspondingly adapts a projection-type condition for optimality, gradient projection method (GPM). For the case $N=3$, the given in this article examples together with Example 3 in Article I show that: a) the adapted GPM and genetic algorithm (GA) successfully solved numerically the considered transfer and keeping problems; b) the two- and three-step GPM forms significantly surpass the one-step GPM. Moreover, GA and a special class of controls were successfully used in such the transfer problem that $N=20$ and the final time is not assigned. |
| title | Gradient projection method and stochastic search for some optimal control models with spin chains. II |
| topic | Quantum Physics Optimization and Control |
| url | https://arxiv.org/abs/2512.10290 |