Approximate customized proximal point algorithms for separable convex optimization

DOI10.1007/S40305-022-00412-WzbMATH Open1524.90246OpenAlexW4281685141MaRDI QIDQ6155528FDOQ6155528

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

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

zbMATH Keywords

alternating direction method of multipliersproximal point algorithmseparable convex programminginexact criteria

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• On the convergence rate of customized proximal point algorithm for convex optimization and saddle-point problem
• Title not available (Why is that?)

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)