arXiv (All)
open access
Preconditioned Latent Variable Proximal Point Method for Optimal Control Problems with Control Constraints
The latent variable proximal point (LVPP) method solves optimization problems in function spaces with pointwise constraints by a sequence of smooth subproblems whose iterates are strictly feasible. We apply it to linear-quadratic elliptic optimal control problems. Control and observation are distrib
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
- An inexact variable metric proximal linearization method for composite optimization on manifolds#1156203
- Constrained Group Relative Policy Optimization#924504
- Constrained Group Relative Policy Optimization#920273
- Management of Networks with Constrained Devices: Problem Statement and Requirements#501970
- Management of Networks with Constrained Devices: Use Cases#501971
Record · ID 1341567
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