Metraipolis › archive › dc_adfa8e7926b2

Observability as a constraint qualification for a nonsmooth bilevel PDE-constrained problem — arXiv:2610.21377

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.21377
License (as archived)
CC0-1.0
Archived
2026-10-16T10:28:28.364Z
SHA-256 of the archived text
a7749006dc51a42b1602bef9143b49dca886f8371deabaed27a288ec863e1115
Stable URL of this page
https://metraipolis.com/documento/dc_adfa8e7926b2

How to cite

Observability as a constraint qualification for a nonsmooth bilevel PDE-constrained problem — arXiv:2610.21377 — arXiv (en), https://arxiv.org/abs/2610.21377 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_adfa8e7926b2 (Metraipolis archive dc_adfa8e7926b2, sha256 a7749006dc51a42b1602bef9143b49dca886f8371deabaed27a288ec863e1115)
BibTeX
@misc{dcadfa8e7926b2,
  title = {Observability as a constraint qualification for a nonsmooth bilevel PDE-constrained problem — arXiv:2610.21377},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.21377},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_adfa8e7926b2; sha256 a7749006dc51a42b1602bef9143b49dca886f8371deabaed27a288ec863e1115},
  year = {2026}
}

Archived text

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

Motivated by experiment design for parameter identification in image reconstruction, we analyze a bilevel control problem involving sparse inversion at the lower level. Qualified optimality conditions in explicit multiplier form are shown to hold under either an observability condition for a coupled system or the Lebesgue nullity of a contact set induced by the lower-level adjoint variable. We prove that these conditions are independent of one another and that they cannot, in general, both be omitted. The approach is based on the characterization of local first-order geometric objects (tangent and normal cones) associated with a set of lifted constraints. Based on the resulting optimality conditions, we formulate a reduced gradient method and illustrate it through numerical experiments.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.21377 — 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-16T08:49:47.920Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).