Peaceman-Rachford splitting for a class of nonconvex optimization problems
From MaRDI portal
Publication:1687318
DOI10.1007/s10589-017-9915-8zbMath1387.90198arXiv1507.00887OpenAlexW2962693890WikidataQ57511124 ScholiaQ57511124MaRDI QIDQ1687318
Tianxiang Liu, Ting Kei Pong, Guoyin Li
Publication date: 22 December 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.00887
Related Items
An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems, Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms, Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems, Local convergence of the heavy-ball method and iPiano for non-convex optimization, Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm, A splitting method for finding the resolvent of the sum of two maximal monotone operators, Half-quadratic alternating direction method of multipliers for robust orthogonal tensor approximation, An envelope for Davis-Yin splitting and strict saddle-point avoidance, A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems, Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano, A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization, General splitting methods with linearization for the split feasibility problem, Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems, Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results, A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization, Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Asymptotics for Lasso-type estimators.
- An alternating direction method for finding Dantzig selectors
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- 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
- Variable selection and dependency networks for genomewide data
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Clarke Subgradients of Stratifiable Functions
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- On Projection Algorithms for Solving Convex Feasibility Problems
- Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
- Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Convex analysis and monotone operator theory in Hilbert spaces
