Mixing proximal regularization, penalization and parallel decomposition in convex programming
[For the entire collection see Zbl 0746.00073.] Let \(A\) and \(B\) be two mutually complementary subspaces of a real Hilbert space \(H\), and \(T\) be a maximal operator on \(H\). In order to solve the problem (P): `find \(x\in A\) and \(y\in B\) such that \(y\in Tx\)', \textit{J. E. Spingarn} [Appl. Math. Optimization 10, 247-265 (1983; Zbl 0524.90072)] introduced the method of partial inverses. In the present paper the author studies a perturbed version of the method of partial inverses. An application to finite dimensional convex programming is considered.
- An inexact method of partial inverses and a parallel bundle method
- An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Combining The Proximal Algorithm And Tikhonov Regularization
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- A partial complement method for approximating solutions of a primal dual fixed-point problem
- Partial inverse operator and recession notion
- Proximal methods for the elastography inverse problem of tumor identification using an equation error approach
- An inexact method of partial inverses and a parallel bundle method
- Splitting proximal with penalization schemes for additive convex hierarchical minimization problems
This page was built for publication: Mixing proximal regularization, penalization and parallel decomposition in convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4026941)
