A partial inexact proximal point method for separable convex programming

MaRDI QIDQ5196880zbMATH OpenFDO

Authors Xiaobiao Chen, Meiyu Zhang, Geng-Hua Li

Publication date 20 September 2019

zbMATH Keywords

alternating direction methodconvex programmingproximal point methodprediction-correction methodstructured variational inequality

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

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

Cited in

(10)

• A linearized method for the separable convex programming with objective function represented as three functions
• scientific article; zbMATH DE number 1292040 (Why is no real title available?)
• 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)