A decomposition method for convex minimization problems and its application.

DOI10.1007/BF02669680zbMath1168.90573OpenAlexW2049741341MaRDI QIDQ5931895

Yi-Fan Xu, Fang Wu

Publication date: 6 May 2001

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02669680

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Unnamed Item
• Unnamed Item
• On the convergence of Han's method for convex programming with quadratic objective
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Convergence of some algorithms for convex minimization
• A proximal-based deomposition method for compositions method for convex minimization problems
• A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
• A Parallel Algorithm for a Class of Convex Programs
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Numerical methods for nondifferentiable convex optimization