On convergence analysis of dual proximal-gradient methods with approximate gradient for a class of nonsmooth convex minimization problems

DOI10.3934/jimo.2016.12.389zbMath1317.90238OpenAlexW2058485202MaRDI QIDQ2515292

Sanming Liu, Zhijie Wang, Chongyang Liu

Publication date: 31 July 2015

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2016.12.389

zbMATH Keywords

convergence analysisdual problemapproximate gradientnonsmooth convex optimizationstrongly convexproximal-gradient methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods involving duality (49M29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

An adaptive trust region algorithm for large-residual nonsmooth least squares problems

Uses Software

• UNLocBoX
• Yall1

Cites Work

• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
• A fast dual proximal gradient algorithm for convex minimization and applications
• Proximal Splitting Methods in Signal Processing
• Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Monotone Operators and the Proximal Point Algorithm
• Proximité et dualité dans un espace hilbertien
• Convex Analysis