A modified Bregman proximal scheme to minimize the difference of two convex functions

zbMATH Open1161.90464MaRDI QIDQ5505201FDOQ5505201

Authors Abdelouahed Hamdi 

Publication date 26 January 2009

Full work available at URL https://eudml.org/doc/55428

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A Moreau-Yosida regularization of a difference of two convex functions
• Proximal Minimization Methods with Generalized Bregman Functions
• Global convergence of a proximal linearized algorithm for difference of convex functions
• Convergence analysis of a proximal point algorithm for minimizing differences of functions
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming

Cited In (9)

• Inertial proximal algorithm for difference of two maximal monotone operators
• On difference of two monotone operators
• On the difference of two maximal monotone operators: Regularization and algorithmic approaches
• Fractional dynamical systems for variational inclusions involving difference of operators
• Foreword
• Notes on the difference of two monotone operators
• General variational inclusions involving difference of operators
• An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels
• A Moreau-Yosida regularization of a difference of two convex functions

This page was built for publication: A modified Bregman proximal scheme to minimize the difference of two convex functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505201)