Metraipolis › archive › dc_588cdbcc3560

Control and Estimation Co-Design via Envelope-Theorem Gradients — arXiv:2609.36090

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.36090
License (as archived)
CC0-1.0
Archived
2026-10-07T18:02:16.587Z
SHA-256 of the archived text
8dce6c0cdd1b0c17dd446354ce5aa2252975aee2a5ebba8846f4aa017d521c60
Stable URL of this page
https://metraipolis.com/documento/dc_588cdbcc3560

How to cite

Control and Estimation Co-Design via Envelope-Theorem Gradients — arXiv:2609.36090 — arXiv (en), https://arxiv.org/abs/2609.36090 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_588cdbcc3560 (Metraipolis archive dc_588cdbcc3560, sha256 8dce6c0cdd1b0c17dd446354ce5aa2252975aee2a5ebba8846f4aa017d521c60)
BibTeX
@misc{dc588cdbcc3560,
  title = {Control and Estimation Co-Design via Envelope-Theorem Gradients — arXiv:2609.36090},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.36090},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_588cdbcc3560; sha256 8dce6c0cdd1b0c17dd446354ce5aa2252975aee2a5ebba8846f4aa017d521c60},
  year = {2026}
}

Archived text

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

Instead of the sequential plant--control--estimator design pipeline, which is in general not optimal, we propose the Control and Estimation Co-Design (ContEst) framework, which poses the entire system design as a single two-stage problem solved by first-order methods. A key enabler is that the gradient of each inner control/estimation optimal cost with respect to the design parameters is available from the dual variables the inner solver already returns, by the envelope theorem: exactly under mild regularity (a unique inner minimizer), and as a subgradient under more relaxed conditions. That is, no differentiation through the optimizer or its optimality conditions is needed. We first present the framework in a linear quadratic Gaussian (LQG) regime, where the control and estimation costs become two semidefinite programs (SDPs) whose design gradients are read from the duals of the Lyapunov constraints. We extend the results to robust ($H_\infty$) formulation to cover worst-case control and filtering problems. We also present an extension to constrained and nonlinear systems, using an extended Kalman filter (eKF) and a local linearization of the information-state dynamics to yield an approximate but convex model predictive control (MPC) problem whose design gradients are read directly from the costates. We apply our methods to a variety of realistic design examples from different fields and report significant design improvements.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.OC).
Categorie arXiv: Systems and Control (eess.SY) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.36090 — 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-07T17:35:03.579Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).