Pith. sign in

REVIEW 1 cited by

An Optimal Control Theory for Accelerated Optimization

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 1902.09004 v3 pith:HQ3CXSRH submitted 2019-02-24 math.OC

classification math.OC
keywords controlproblemoptimaloptimizationalgorithmconditionsacceleratedgeneric
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The first-order optimality conditions for a generic nonlinear optimization problem are generated as part of the terminal transversality conditions of an optimal control problem. It is shown that the Lagrangian of the optimization problem is connected to the Hamiltonian of the optimal control problem via a zero-Hamiltonian, infinite-order, singular arc. The necessary conditions for the singular optimal control problem are used to produce an auxiliary controllable dynamical system whose trajectories generate algorithm primitives for the optimization problem. A three-step iterative map for a generic algorithm is designed by a semi-discretization step. Neither the feedback control law nor the differential equation governing the algorithm need be derived explicitly. A search direction is produced by a proximal-aiming-type method that dissipates a control Lyapunov function. New step size procedures based on minimizing control Lyapunov functions along a search vector complete the design of the accelerated algorithms.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 3 citations worldwide. Full citation record

  1. Contributions to Robust and Efficient Methods for Analysis of High Dimensional Data

    math.ST 2025-09 conditional novelty 5.0 of 10

    A three-manuscript thesis: nonlinear MI-based screening for neuroimaging, faster accelerated-gradient hyperparameters for nonconvex sparse learning, and a theoretically derived but unvalidated qGaussian linear mixed model.

Pith tools