A linear approximate Bregman-type Peaceman-Rachford splitting method for nonconvex nonseparable optimization
From MaRDI portal
Publication:6203708
DOI10.12386/A20210081MaRDI QIDQ6203708FDOQ6203708
Authors: Pengjie Liu, Jinbao Jian, Guodong Ma, JiaWei Xu 
Publication date: 8 April 2024
Recommendations
- Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization
- Two linear proximal Peaceman-Rachford splitting algorithms for nonconvex and nonsmooth nonseparable optimization
- Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems
- Convergence of Peaceman-Rachford splitting method with Bregman distance for three-block nonconvex nonseparable optimization
- Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs
convergence rateKurdyka-Łojasiewicz propertynonconvex nonseparable optimizationlinear approximate techniquePaceman-Rachford splitting method
Cites Work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Title not available (Why is that?)
- 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
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions
- Comments on: ``Wavelets in statistics: a review by A. Antoniadis
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Global convergence of splitting methods for nonconvex composite optimization
- Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs
- Group variable selection via SCAD-L2
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
- A proximal alternating direction method for multi-block coupled convex optimization
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
- Title not available (Why is that?)
- First-order algorithms for convex optimization with nonseparable objective and coupled constraints
- Hybrid Jacobian and Gauss-Seidel proximal block coordinate update methods for linearly constrained convex programming
- An ADMM-based SQP method for separably smooth nonconvex optimization
- Convergence of linear Bregman ADMM for nonconvex and nonsmooth problems with nonseparable structure
- Convergence of ADMM for optimization problems with nonseparable nonconvex objective and linear constraints
- Inertial proximal alternating minimization for nonconvex and nonsmooth problems
- An inertial proximal alternating direction method of multipliers for nonconvex optimization
- The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
- A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
- Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
- Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms
- An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization
- A proximal block minimization method of multipliers with a substitution procedure
- Convergence of generalized alternating direction method of multipliers for nonseparable nonconvex objective with linear constraints
Cited In (5)
- A Bregman-style improved ADMM and its linearized version in the nonconvex setting: convergence and rate analyses
- Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization
- An inertial proximal splitting method with applications
- Convergence of Peaceman-Rachford splitting method with Bregman distance for three-block nonconvex nonseparable optimization
- Two linear proximal Peaceman-Rachford splitting algorithms for nonconvex and nonsmooth nonseparable optimization
This page was built for publication: A linear approximate Bregman-type Peaceman-Rachford splitting method for nonconvex nonseparable optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6203708)
