Proximal Decomposition on the Graph of a Maximal Monotone Operator
From MaRDI portal
Publication:4838965
DOI10.1137/0805023zbMath0834.90105OpenAlexW2030731960MaRDI QIDQ4838965
Philippe Mahey, Tao Pham Dinh, Said Oualibouch
Publication date: 13 January 1997
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0805023
Related Items (25)
Some recent advances in projection-type methods for variational inequalities ⋮ On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces ⋮ Unnamed Item ⋮ Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming ⋮ Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ Monotone operator theory in convex optimization ⋮ Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres ⋮ A proximal alternating linearization method for nonconvex optimization problems ⋮ A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems ⋮ A survey on operator splitting and decomposition of convex programs ⋮ Modified Lagrangian methods for separable optimization problems ⋮ An asymmetric proximal decomposition method for convex programming with linearly coupling constraints ⋮ A primal-dual method of partial inverses for composite inclusions ⋮ Convergence analysis of difference-of-convex algorithm with subanalytic data ⋮ 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 ⋮ 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 ⋮ A proximal multiplier method for separable convex minimization ⋮ Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity ⋮ Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators ⋮ On Algorithms for Difference of Monotone Operators ⋮ On Algorithms for Difference of Monotone Operators ⋮ An inexact method of partial inverses and a parallel bundle method ⋮ Numerical solution for optimization over the efficient set by d.c. optimization algorithms
This page was built for publication: Proximal Decomposition on the Graph of a Maximal Monotone Operator
