arXiv (All)
open access
Soft-Update MSA for Nonconvex Stochastic Optimal Control: Theory and Algorithms
For the method of successive approximations (MSA), a fundamental challenge is that the stochastic maximum principle (SMP) provides an optimality condition rather than a descent rule. To overcome this difficulty for nonconvex stochastic control problems, we develop a soft-update MSA (SU-MSA) with a s
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
- A Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization#160891
- Contraction-Aware Reinforcement Learning for Nonlinear Control with Statistical Robustness#612794
- Contraction-Aware Reinforcement Learning for Nonlinear Control with Statistical Robustness#611317
- Elastic ODYN: Differentiable Optimization for Infeasible Control and Learning in Robotics#1141569
- Weakly chained matrices, policy iteration, and impulse control#984767
Record · ID 1423377
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