Split proximal linearized algorithm and convergence theorems for the split DC program
From MaRDI portal
Publication:2067889
DOI10.1186/s13660-019-2084-9zbMath1499.90169OpenAlexW2947971048MaRDI QIDQ2067889
Publication date: 19 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-019-2084-9
Convex programming (90C25) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Strong convergence theorems for the split variational inclusion problem in Hilbert spaces
- Lagrange-type duality in DC programming
- Split monotone variational inclusions
- Totally convex functions for fixed points computation and infinite dimensional optimization
- Convergence of generalized proximal point algorithms
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Optimality conditions for DC programming problems with reverse convex constraints
- Lagrange duality in canonical DC programming
- The Split Common Null Point Problem
- A fast quadratic programming algorithm for positive signal restoration
- Signal Recovery by Proximal Forward-Backward Splitting
- Convex analysis and monotone operator theory in Hilbert spaces