Proximal Decomposition on the Graph of a Maximal Monotone Operator
From MaRDI portal
Recommendations
- On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- An inexact method of partial inverses and a parallel bundle method
- A Generalization of the Proximal Point Algorithm
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
Cited in
(29)- Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
- Monotone operator theory in convex optimization
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- Two-level primal-dual proximal decomposition technique to solve large scale optimization problems
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Some recent advances in projection-type methods for variational inequalities
- Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- A proximal multiplier method for separable convex minimization
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
- Decomposition methods based on augmented Lagrangians: a survey
- A proximal alternating linearization method for nonconvex optimization problems
- A survey on operator splitting and decomposition of convex programs
- A unified splitting algorithm for composite monotone inclusions
- Modified Lagrangian methods for separable optimization problems
- An asymmetric proximal decomposition method for convex programming with linearly coupling constraints
- scientific article; zbMATH DE number 1488000 (Why is no real title available?)
- A primal-dual method of partial inverses for composite inclusions
- On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm
- Decomposition methods for a spatial model for long-term energy pricing problem
- On a decomposition formula for the proximal operator of the sum of two convex functions
- Computational Science and Its Applications – ICCSA 2004
- An inexact method of partial inverses and a parallel bundle method
- On Algorithms for Difference of Monotone Operators
- On algorithms for difference of monotone operators
- The geometry of monotone operator splitting methods
- Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming
This page was built for publication: Proximal Decomposition on the Graph of a Maximal Monotone Operator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4838965)
