A line-search-based partial proximal alternating directions method for separable convex optimization

DOI10.1155/2014/540450zbMath1442.90148OpenAlexW2099209408WikidataQ59053460 ScholiaQ59053460MaRDI QIDQ2336520

Zheng Peng, Yu-Fei Yang, Yu-Hua Zeng

Publication date: 19 November 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/540450

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Unnamed Item
• Unnamed Item
• Two numerical schemes for general variational inequalities
• A proximal-based deomposition method for compositions method for convex minimization problems
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• A new inexact alternating directions method for monotone variational inequalities
• A modified alternating direction method for convex minimization problems
• A Class of Inexact Variable Metric Proximal Point Algorithms
• Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing

This page was built for publication: A line-search-based partial proximal alternating directions method for separable convex optimization