A New Class of Path-Following Method for Time-Varying Optimization with Optimal Parametric Function
Mohsen Amidzadeh

TL;DR
This paper introduces OP-TVO, a novel iterative algorithm for time-varying constrained optimization that uses parametric functions and dynamical systems, demonstrating competitive performance with existing methods like PCM.
Contribution
It proposes a new parametric dynamical system approach and an optimization framework for solving time-varying nonlinear constrained problems efficiently.
Findings
OP-TVO achieves competitive convergence rates.
The algorithm reduces computational complexity compared to PCM.
It offers a new paradigm for solving parametric dynamical systems.
Abstract
In this paper, we consider a formulation of nonlinear constrained optimization problems. We reformulate it as a time-varying optimization using continuous-time parametric functions and derive a dynamical system for tracking the optimal solution. We then re-parameterize the dynamical system to express it based on a linear combination of the parametric functions. Calculus of variations is applied to optimize the parametric functions, so that the optimality distance of the solution is minimized. Accordingly, an iterative dynamic algorithm, named as OP-TVO, is devised to find the solution with an efficient convergence rate. We benchmark the performance of the proposed algorithm with the prediction-correction method (PCM) from the optimality and computational complexity point-of-views. The results show that OP-TVO can compete with PCM for the optimization problem of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Metaheuristic Optimization Algorithms Research
