An inexact method of partial inverses and a parallel bundle method

DOI10.1080/10556780500094887zbMath1091.49006OpenAlexW2018298108WikidataQ58048531 ScholiaQ58048531MaRDI QIDQ5475281

Regina Sandra Burachik, Susana Scheimberg, Claudia A. Sagastizábal

Publication date: 16 June 2006

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780500094887

zbMATH Keywords

maximal monotone operatorsplitting methodsenlargement of a maximal monotone operatorhybrid proximal methodsparallel bundle methods

Mathematics Subject Classification ID

Variational inequalities (49J40) Nonsmooth analysis (49J52) Monotone operators and generalizations (47H05) Numerical solutions to equations with nonlinear operators (65J15) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Related Items (8)

Another proof and a generalization of a theorem of H. H. Bauschke on monotone operators ⋮ A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization ⋮ On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems ⋮ An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization ⋮ Enlargements: a bridge between maximal monotonicity and convexity ⋮ Modified Lagrangian methods for separable optimization problems ⋮ 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

Uses Software

• PLCP

Cites Work

• Partial inverse of a monotone operator
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Enlargement of monotone operators with applications to variational inequalities
• Epsilon-proximal decomposition method
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
• A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS^*
• Applications of the method of partial inverses to convex programming: Decomposition
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Proximal Decomposition on the Graph of a Maximal Monotone Operator
• Numerical optimization. Theoretical and practical aspects. Transl. from the French

This page was built for publication: An inexact method of partial inverses and a parallel bundle method