Abstract
Let A and B be two mutually complementary subspaces of a real Hubert space H, T being a maximal monotone operator on H. The method of partial inverses has been introduced by J. Spingarn in 1983 for solving problems in which the object is to find x ∈ A and y ∈ B such that y ∈ Tx. We present a perturbed version of this method and its most important application: a perturbed method of parallel decomposition in convex programming.1
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Attouch, H.: Variational Convergence for Functions and Operators, Applicable Mathematics Series, Pitman, London, 1984.
Attouch, H., Wets, R.J.B.: Isometries for the Legendre-Fenchel Transform, Trans. A.M.S., vol. 296, 1, 1986, pp. 33–60.
Attouch, H., Wets, R.J.B.: Quantitative Stability of Variational Systems: I. The Epigraphical Distance, Techn. Report, AVAMAC, Université de Perpignan, 1987.
Auslender, A., Crouzeix, J.R., Fedit, P.: Penalty Proximal Methods in Convex Programming, Journal of Optimization Theory and Applications, vol. 55, 1, 1987, pp. 1–21.
Gowda, M.S., Teboule, M.: A Comparison of Constraint Qualification in Infinite-Dimensional Convex Programming, SIAM J. Control and Optimization, vol. 28, 4, 1990, pp. 925–935.
Lemaire, B.: Coupling Optimization Methods and Variational Convergence, Trends in Mathematical Optimization International Series of Num. Math., K.H. Hoffmann, J.B. Hiriart-Urruty, C. Lemarechal, J. Zowe, editors, Birkhäuser Verlag, Basel, vol. 84, 1988, pp. 163–179.
Moudafi, A.: Perturbation de la méthode de Vinverse partiel, Techn. Report, AVAMAC, Université de Perpignan, 1987.
Rockafellar, R.T.: Monotone Operators and the Proximal Point Algorithm, SIAM J. Control and Optimization, vol. 14, 5, 1976, pp. 877–898.
Spingarn, J.E.: Partial Inverse of a Monotone Operator, Applied Mathematics and Optimization, vol. 10, 1983, pp. 247–265, Springer-Verlag, New-York.
Spingarn, J.E.: Applications of the Method of Partial Inverses to Convex Programming: Decomposition, Math. Programming, vol. 32, 1985, pp. 199–223, North-Holland.
Tossings, P.: Sur les zéros des opérateurs maximaux monotones et applications, Thèse d’Etat, Université de Liège, 1990.
Tossings, P.: Convergence variationnelle et opérateurs maximaux monotones d’un espace de Hilbert réel, Bull. Soc. Roy. Se. de Liège, vol. 60, 2, 1991, pp. 103–132.
Tossings, P.: The Perturbed Proximal Point Algorithm and Some of its Applications, submitted to Applied Mathematics and Optimization.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tossings, P. (1992). Mixing proximal regularization, penalization and parallel decomposition in convex programming. In: Oettli, W., Pallaschke, D. (eds) Advances in Optimization. Lecture Notes in Economics and Mathematical Systems, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51682-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-51682-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55446-2
Online ISBN: 978-3-642-51682-5
eBook Packages: Springer Book Archive