Dual-primal proximal point algorithms for extended convex programming

DOI10.1080/00207160.2014.945920MaRDI QIDQ5266145zbMATH OpenOpenAlexFDO

Authors Min Li, Zhikai Jiang, Zhangjin Zhou

Publication date 30 July 2015

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160.2014.945920

zbMATH Keywords

convergence rateconvex programmingdual-primallinear constraintsproximal point algorithm

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonlinear programming (90C30)

Recommendations

• A primal-dual proximal point algorithm for constrained convex programs
• Primal-dual proximal point algorithm for linearly constrained convex programming problems
• Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
• On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
• Proximal point algorithms for general variational inequalities

Cites work

• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A new inexact alternating directions method for monotone variational inequalities
• A primal-dual proximal point algorithm for constrained convex programs
• A Singular Value Thresholding Algorithm for Matrix Completion
• Alternating direction method with Gaussian back substitution for separable convex programming
• An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
• Application of the alternating direction method of multipliers to separable convex programming problems
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Decomposition methods based on augmented Lagrangians: a survey
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• scientific article; zbMATH DE number 3833218 (Why is no real title available?)
• Monotone Operators and the Proximal Point Algorithm
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method

Cited in

(5)

• Primal-dual proximal point algorithm for linearly constrained convex programming problems
• A primal-dual proximal point algorithm for constrained convex programs
• Nonlinear least square based on control direction by dual method and its application
• A class of customized proximal point algorithms for linearly constrained convex optimization
• Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach

This page was built for publication: Dual-primal proximal point algorithms for extended convex programming

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