A Partial Regularization Method for Saddle Point Seeking
暂无分享,去创建一个
[1] S. Kurcyusz,et al. Projection on a Cone, Penalty Functionals and Duality Theory for Problems with Inequaltity Constraints in Hilbert Space , 1977 .
[2] B. V. Dean,et al. Studies in Linear and Non-Linear Programming. , 1959 .
[3] R. Tyrrell Rockafellar,et al. Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming , 1976, Math. Oper. Res..
[4] A. Ruszczynski. Augmented Lagrangian Decomposition for Sparse Convex Optimization , 1992 .
[5] G. M. Korpelevich. The extragradient method for finding saddle points and other problems , 1976 .
[6] R. Rockafellar. Monotone Operators and the Proximal Point Algorithm , 1976 .
[7] B. Martinet. Brève communication. Régularisation d'inéquations variationnelles par approximations successives , 1970 .
[8] Parallel Solution of Linear Programs Via Nash Equilibria , 1994 .
[9] R. Tyrrell Rockafellar,et al. Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.
[10] Dimitri P. Bertsekas,et al. On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators , 1992, Math. Program..