Approximate customized proximal point algorithms for separable convex optimization

DOI10.1007/S40305-022-00412-WMaRDI QIDQ6155528zbMATH OpenOpenAlexFDO

Authors Hongmei Chen, Xing-Ju Cai, Lingling Xu

Publication date 5 June 2023

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40305-022-00412-w

zbMATH Keywords

alternating direction method of multipliersproximal point algorithmseparable convex programminginexact criteria

Mathematics Subject Classification ID

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

Recommendations

• Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
• A class of customized proximal point algorithms for linearly constrained convex optimization
• A customized proximal point algorithm for convex minimization with linear constraints
• On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
• A parameterized proximal point algorithm for separable convex optimization

Cites work

• scientific article; zbMATH DE number 3574917 (Why is no real title available?)
• scientific article; zbMATH DE number 1369459 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• A Singular Value Thresholding Algorithm for Matrix Completion
• A class of customized proximal point algorithms for linearly constrained convex optimization
• A customized proximal point algorithm for convex minimization with linear constraints
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• A parameterized proximal point algorithm for separable convex optimization
• A proximal point algorithm revisit on the alternating direction method of multipliers
• An inexact alternating direction method of multipliers with relative error criteria
• Approximate ADMM algorithms derived from Lagrangian splitting
• Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Image recovery via total variation minimization and related problems
• Inexact first-order primal-dual algorithms
• Matrix completion via an alternating direction method
• Monotone Operators and the Proximal Point Algorithm
• Multiplier and gradient methods
• Nonlinear total variation based noise removal algorithms
• On inexact ADMMs with relative error criteria
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
• Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
• Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• \(O(1/t)\) complexity analysis of the generalized alternating direction method of multipliers

Cited in

(2)

• On the convergence rate of customized proximal point algorithm for convex optimization and saddle-point problem
• scientific article; zbMATH DE number 1292040 (Why is no real title available?)

This page was built for publication: Approximate customized proximal point algorithms for separable convex optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155528)