A Bregman Lagrangian with a logarithmic barrier leads to a continuous-time dynamical system and discrete accelerated methods that converge to the solution of convex inequality-constrained problems.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem
A Bregman Lagrangian with a logarithmic barrier leads to a continuous-time dynamical system and discrete accelerated methods that converge to the solution of convex inequality-constrained problems.