A partial inexact proximal point method for separable convex programming
From MaRDI portal
Publication:5196880
zbMATH Open1438.90253MaRDI QIDQ5196880FDOQ5196880
Authors: Xiaobiao Chen, Meiyu Zhang, Geng-Hua Li 
Publication date: 20 September 2019
Recommendations
- An inexact partial alternating direction method for convex programming problem
- scientific article; zbMATH DE number 6453677
- A line-search-based partial proximal alternating directions method for separable convex optimization
- Applications of the method of partial inverses to convex programming: Decomposition
- A splitting method for separable convex programming
alternating direction methodconvex programmingproximal point methodprediction-correction methodstructured variational inequality
Cited In (10)
- A linearized method for the separable convex programming with objective function represented as three functions
- Title not available (Why is that?)
- A parameterized proximal point algorithm for separable convex optimization
- A proximal multiplier method for separable convex minimization
- Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming
- PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS
- An adaptive partial linearization method for optimization problems on product sets
- An inexact partial alternating direction method for convex programming problem
- An inexact hybrid splitting method for separable convex optimization
- A line-search-based partial proximal alternating directions method for separable convex optimization
This page was built for publication: A partial inexact proximal point method for separable convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5196880)
