DCA corresponds to Euler discretization of a Bregman gradient flow, with a damped version providing monotone descent, global linear rates under metric DC-PL, and local exponential convergence near nondegenerate minima.
Polyak, ‘The conjugate gradient method in extremal problems,’ USSR Computational Mathematics and Mathematical Physics , vol
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Approximate one-time preconditioning in face for MPGP algorithms yields error bounds, a sharp condition-number estimate, and large observed speedups on quadratic programs with constraints.
A critical review of fluorescence nanothermometry probes, mechanisms, recent advances, challenges, and future directions for nanoscale temperature measurement.
citing papers explorer
-
Continuous-Time Dynamics of the Difference-of-Convex Algorithm
DCA corresponds to Euler discretization of a Bregman gradient flow, with a damped version providing monotone descent, global linear rates under metric DC-PL, and local exponential convergence near nondegenerate minima.
-
Nanoscale Fluorescence Thermometry: Probes, Recent Advances and Emerging Directions
A critical review of fluorescence nanothermometry probes, mechanisms, recent advances, challenges, and future directions for nanoscale temperature measurement.