Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces
From MaRDI portal
Publication:2419566
DOI10.1007/s10589-019-00087-9zbMath1423.90176OpenAlexW2921107126MaRDI QIDQ2419566
Eike Börgens, Christian Kanzow
Publication date: 13 June 2019
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-019-00087-9
global convergenceHilbert spacealternating direction method of multipliersseparable convex optimizationproximal-point method
Related Items
On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming, A proximal fully parallel splitting method with a relaxation factor for separable convex programming, A splitting algorithm for constrained optimization problems with parabolic equations, J‐ADMM for a multi‐contact problem in electro‐elastostatics, ADMM-Type Methods for Generalized Nash Equilibrium Problems in Hilbert Spaces, Parametrized inexact-ADMM based coordination games: a normalized Nash equilibrium approach, A Distributed Regularized Jacobi-Type ADMM-Method for Generalized Nash Equilibrium Problems in Hilbert Spaces, Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems, A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- An algorithm twisted from generalized ADMM for multi-block separable convex minimization models
- An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures
- Comments on ``The proximal point algorithm revisited
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- Applied functional analysis. Functional analysis, Sobolev spaces and elliptic differential equations
- Produits infinis de resolvantes
- Approximate iterations in Bregman-function-based proximal algorithms
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- The proximal point algorithm revisited
- On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM
- INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- Generalized Nash Equilibrium Problems in Banach Spaces: Theory, Nikaido--Isoda-Based Path-Following Methods, and Applications
- Solving PDEs in Python
- On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
- Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers
- Lagrange Multiplier Approach to Variational Problems and Applications
- Monotone Operators and the Proximal Point Algorithm
- Numerical Optimization
- The Multiplier-Penalty Method for Generalized Nash Equilibrium Problems in Banach Spaces
- A Distributed Regularized Jacobi-Type ADMM-Method for Generalized Nash Equilibrium Problems in Hilbert Spaces
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
- Fixed points of nonexpanding maps
- Convex analysis and monotone operator theory in Hilbert spaces
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
