论文信息 - Coupling proximal methods and variational convergence - 字舞流文

Coupling proximal methods and variational convergence

An approximation method which combines a data perturbation by variational convergence with the proximal point algorithm, is presented. Conditions which guarantee convergence, are provided and an application to the partial inverse method is given.

Abdellatif Moudafi | A. Moudafi

[1] Bernard Martinet,et al. Algorithmes pour la résolution de problèmes d'optimisation et de minimax , 1972 .

[2] G. Minty. Monotone (nonlinear) operators in Hilbert space , 1962 .

[3] R. Wets,et al. Quantitative stability of variational systems. I. The epigraphical distance , 1991 .

[4] R. Rockafellar. Monotone Operators and the Proximal Point Algorithm , 1976 .

[5] P. Alart,et al. Penalization in non-classical convex programming via variational convergence , 1991, Math. Program..

[6] A. Auslender,et al. Penalty-proximal methods in convex programming , 1987 .

[7] Abdellatif Moudafi,et al. Quantitative stability analysis for maximal monotone operators and semi-groups of contractions , 1993 .

[8] F. Luque. Asymptotic convergence analysis of the proximal point algorithm , 1984 .

[9] B. Lemaire. Coupling optimization methods and variational convergence , 1988 .

[10] Jonathan E. Spingarn,et al. Applications of the method of partial inverses to convex programming: Decomposition , 1985, Math. Program..

[11] James M. Ortega,et al. Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[12] J. Spingarn. Partial inverse of a monotone operator , 1983 .

[13] Z. Opial. Weak convergence of the sequence of successive approximations for nonexpansive mappings , 1967 .