Metraipolis › archive › dc_7d4cc6ab9d86

A penalty-type method for relaxed inverse optimal control problems — arXiv:2608.12769

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.12769
License (as archived)
CC0-1.0
Archived
2026-10-19T04:46:23.759Z
SHA-256 of the archived text
a7d055c93b6380d1880f61e48b5fb3059cc89146bbcff60bf500fe7d5df1939b
Stable URL of this page
https://metraipolis.com/documento/dc_7d4cc6ab9d86

How to cite

A penalty-type method for relaxed inverse optimal control problems — arXiv:2608.12769 — arXiv (en), https://arxiv.org/abs/2608.12769 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7d4cc6ab9d86 (Metraipolis archive dc_7d4cc6ab9d86, sha256 a7d055c93b6380d1880f61e48b5fb3059cc89146bbcff60bf500fe7d5df1939b)
BibTeX
@misc{dc7d4cc6ab9d86,
  title = {A penalty-type method for relaxed inverse optimal control problems — arXiv:2608.12769},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.12769},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7d4cc6ab9d86; sha256 a7d055c93b6380d1880f61e48b5fb3059cc89146bbcff60bf500fe7d5df1939b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.12769. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This paper is devoted to the introduction and analysis of a penalty-type method for the numerical treatment of a class of bilevel optimization problems arising from inverse optimal control. The algorithm is designed to compute stationary points of the associated relaxed value function reformulation. This is achieved by determining a sequence of stationary points associated with a sequence of surrogate problems where the relaxed value function constraint is penalized, where the updates of upper- and lower-level decision variables are decoupled, and where the penalty parameter is enlarged only in those iterations which do not come along with a sufficient improvement of some feasibility measure. The resulting method does not comprise any linesearch, the lower-level problem has to be evaluated just once per iteration, and the penalty parameter does not need to be driven to infinity. Nevertheless, subsequential convergence results are obtained under reasonable assumptions. Numerical experiments, where the relaxation parameter is also driven to zero, visualize effectiveness of the approach.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-14 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2608.12769 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T04:27:11.021Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).