Abstract

In a Hilbert space setting, this paper is devoted to the study of a class of first-order algorithms which aim to solve structured monotone equations involving the sum of potential and nonpotential operators. Precisely, we are looking for the zeros of an operator $$A= \nabla f +B $$ , where $$\nabla f$$ is the gradient of a differentiable convex function f, and B is a nonpotential monotone and cocoercive operator. This study is based on the inertial autonomous dynamic previously studied by the authors, which involves dampings controlled respectively by the Hessian of f, and by a Newton-type correction term attached to B. These geometric dampings attenuate the oscillations which occur with the inertial methods with viscous damping. Temporal discretization of this dynamic provides fully splitted proximal-gradient algorithms. Their convergence properties are proven using Lyapunov analysis. These results open the door to the design of first-order accelerated algorithms in numerical optimization taking into account the specific properties of potential and nonpotential terms.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.