Papers › Arbitrarily Small Execution-Time Certificate: What was Missed in Analog Optimization
Arbitrarily Small Execution-Time Certificate: What was Missed in Analog Optimization
Liang Wu, Ambrose Adegbege, Yongduan Song, Richard D. Braatz
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Numerical optimization (solving optimization problems using digital computers) currently dominates but has three major drawbacks: high energy consumption, poor scalability, and lack of an execution time certificate. To address these challenges, this article explores the recent resurgence of analog computers, proposing a novel paradigm of arbitrarily small execution-time-certified analog optimization (solving optimization problems via analog computers). To achieve ultra-low energy consumption, this paradigm transforms optimization problems into ordinary differential equations (ODEs) and leverages the ability of analog computers to naturally solve ODEs (no need for time discretization) in physically real time. However, this transformation can fail if the optimization problem, such as the general convex nonlinear programs (NLPs) considered in this article, has no feasible solution. To avoid transformation failure and enable infeasibility detection, we introduce the homogeneous monotone complementarity problem formulation for convex NLPs. To achieve scalability and an execution time certificate, this paper introduces the Newton-based fixed-time-stable scheme for the transformed ODE, whose settling time Tₚ can be prescribed by choosing the ODE's time coefficient as k=π/2Tₚ. This equation certifies that the settling time (execution time) is independent of the dimension of the optimization problems and can be arbitrarily small if the analog computer allows.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections