Prediction-correction alternating direction method for a class of constrained min-max problems

DOI10.1007/s11464-007-0007-4zbMath1201.65102OpenAlexW2101034177MaRDI QIDQ1956529

Min Li, Bing-sheng He

Publication date: 22 September 2010

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-007-0007-4

zbMATH Keywords

nonlinear programminglinear variational inequalityprojection and contraction methodsconstrained minimum distance problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Minimax problems in mathematical programming (90C47)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximate proximal-extragradient type method for monotone variational inequalities
• Minimizing a sum of norms subject to linear equality constraints
• A variable-penalty alternating directions method for convex optimization
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• A new inexact alternating directions method for monotone variational inequalities
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Dynamic facility location: The progressive p-median problem
• An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms
• An Exact Potential Method for Constrained Maxima
• Constrained Optimization Using a Nondifferentiable Penalty Function

This page was built for publication: Prediction-correction alternating direction method for a class of constrained min-max problems