arXiv (All)
open access
Weak Convexity and Proximal Bundle Methods for Nonsmooth Policy Optimization in Robust Control
We study policy optimization for discrete-time robust $\mathcal{H}_\infty$ control with static output-feedback, and present the first feasibility-preserving algorithm with a deterministic, non-asymptotic complexity guarantee. This problem naturally leads to a nonsmooth and nonconvex optimization ove
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- $$\mathcal {H}_\infty $$ H ∞ Robust Sampled-Data State-Feedback Control of Linear Systems#147689
- Algorithmic Optimality Guarantees for Nonsmooth $H_\infty$ Output-Feedback Policy Search#987861
- Stochastic Robust Linear W-infinity Control via Dynamic Output Feedback#662481
- Stochastic Robust Linear W-infinity Control via Dynamic Output Feedback#661431
- Admissibility-Preserving Control for Strict-Feedback Nonlinear Systems with Asymmetric Actuator Constraints#615344
Record · ID 973801
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive