Optimal design of resolvent splitting algorithms

DOI10.1007/S12532-026-00304-7MaRDI QIDQ7402753zbMATH OpenFDO

Authors Robert L Bassett, Peter Barkley

Publication date 2026

Published in Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12532-026-00304-7

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37)

Cites work

• A Decentralized Proximal-Gradient Method With Network Independent Step-Sizes and Separated Convergence Rates
• A framework for solving mixed-integer semidefinite programs
• A product space reformulation with reduced dimension for splitting algorithms
• A proximal decomposition method for solving convex variational inverse problems
• A Proximal Gradient Algorithm for Decentralized Composite Optimization
• Convex Analysis
• Convex analysis and monotone operator theory in Hilbert spaces
• Convex optimization of graph Laplacian eigenvalues
• Critical-Path Planning and Scheduling: Mathematical Basis
• Degenerate Preconditioned Proximal Point Algorithms
• General Projective Splitting Methods for Sums of Maximal Monotone Operators
• Graph and distributed extensions of the Douglas-Rachford method
• scientific article; zbMATH DE number 3681933 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• On the maximal monotonicity of subdifferential mappings
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Operator splitting performance estimation: tight contraction factors and optimal parameter selection
• PEPIT: computer-assisted worst-case analyses of first-order optimization methods in python
• Performance of first-order methods for smooth convex minimization: a novel approach
• Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
• Pyomo -- optimization modeling in Python
• Resolvent splitting for sums of monotone operators with minimal lifting
• Scalable semidefinite programming
• Semidefinite Programming
• Strengthened splitting methods for computing resolvents
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
• Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting

This page was built for publication: Optimal design of resolvent splitting algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7402753)