Pith. sign in

REVIEW 1 cited by

Accelerated primal-dual methods with enlarged step sizes and operator learning for nonsmooth optimal control problems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2307.00296 v2 pith:KWFQGJZE submitted 2023-07-01 math.OC cs.LGcs.NAmath.NA

Accelerated primal-dual methods with enlarged step sizes and operator learning for nonsmooth optimal control problems

classification math.OC cs.LGcs.NAmath.NA
keywords primal-dualmethodoperatorlearningacceleratedneuralnonsmoothpdes
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We consider a general class of nonsmooth optimal control problems with partial differential equation (PDE) constraints, which are very challenging due to its nonsmooth objective functionals and the resulting high-dimensional and ill-conditioned systems after discretization. We focus on the application of a primal-dual method, with which different types of variables can be treated individually and thus its main computation at each iteration only requires solving two PDEs. Our target is to accelerate the primal-dual method with either larger step sizes or operator learning techniques. For the accelerated primal-dual method with larger step sizes, its convergence can be still proved rigorously while it numerically accelerates the original primal-dual method in a simple and universal way. For the operator learning acceleration, we construct deep neural network surrogate models for the involved PDEs. Once a neural operator is learned, solving a PDE requires only a forward pass of the neural network, and the computational cost is thus substantially reduced. The accelerated primal-dual method with operator learning is mesh-free, numerically efficient, and scalable to different types of PDEs. The acceleration effectiveness of these two techniques is promisingly validated by some preliminary numerical results.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Single-Loop Bilevel Deep Learning Method for Optimal Control of Obstacle Problems

    math.OC 2026-01 conditional novelty 5.0

    Optimal control of obstacle problems is solved mesh-free by training constraint-embedding neural networks with S2-FOBA, a single-loop stochastic bilevel algorithm whose Moreau-penalized gradient converges sublinearly.