Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
From MaRDI portal
Publication:2275326
DOI10.1007/s10957-019-01564-1zbMath1428.90120OpenAlexW2958943509WikidataQ127541017 ScholiaQ127541017MaRDI QIDQ2275326
Publication date: 2 October 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-019-01564-1
Numerical mathematical programming methods (65K05) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (3)
General splitting methods with linearization for the split feasibility problem ⋮ Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems ⋮ A unified Douglas-Rachford algorithm for generalized DC programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- On the convergence rate of Douglas-Rachford operator splitting method
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On gradients of functions definable in o-minimal structures
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Peaceman-Rachford splitting for a class of nonconvex optimization problems
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- On the Douglas-Rachford algorithm
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
- Tensor completion and low-n-rank tensor recovery via convex optimization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming
- Clarke Subgradients of Stratifiable Functions
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
- Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
