An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization

DOI10.1007/s10957-017-1188-yzbMath1464.47038arXiv1610.09728OpenAlexW2542694843MaRDI QIDQ1695823

Maicon Marques Alves, Samara Costa Lima

Publication date: 8 February 2018

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.09728

zbMATH Keywords

splittingparallelcomposite optimizationinexact proximal point methodsforward-backwarditeration-complexitypartial inverse method

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Numerical optimization and variational techniques (65K10) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (3)

Another proof and a generalization of a theorem of H. H. Bauschke on monotone operators ⋮ Tikhonov-like methods with inexact minimization for solving linear ill-posed problems ⋮ On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An adaptive accelerated first-order method for convex optimization
• A practical relative error criterion for augmented Lagrangians
• Attouch-Théra duality revisited: Paramonotonicity and operator splitting
• A primal-dual method of partial inverses for composite inclusions
• Partial inverse of a monotone operator
• Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
• Enlargement of monotone operators with applications to variational inequalities
• Introductory lectures on convex optimization. A basic course.
• Epsilon-proximal decomposition method
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
• A family of projective splitting methods for the sum of two maximal monotone operators
• 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^*
• Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework
• On the proximal point method for equilibrium problems in Hilbert spaces
• On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
• A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
• Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
• A Hybrid Proximal-Extragradient Algorithm with Inertial Effects
• An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems
• General Projective Splitting Methods for Sums of Maximal Monotone Operators
• Monotone Operators and the Proximal Point Algorithm
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
• Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
• An inexact method of partial inverses and a parallel bundle method
• Convex analysis and monotone operator theory in Hilbert spaces
• \(\varepsilon\)-subdifferentials in terms of subdifferentials

This page was built for publication: An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization