Skip to main content
SpringerLink
Log in

Conditioning and Regularization of Nonsymmetric Operators

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

A measure of the conditioning of an operator, depending on the strong monotonicity constant and the Dunn constant, is introduced. A notion of regularization with respect to some operator, which generalizes classical Yosida regularization, is defined. In particular, this transformation allows the construction of decomposition algorithms. The effect of this generalized regularization on the conditioning is studied.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Mataoui, M. A., Contributions à la Décomposition et à l'Agrégation des Problèmes Variationnels, Thesis Dissertation, École des Mines de Paris, Paris, France, 1990.

  2. Dunn, J. C., Convexity, Monotonicity, and Gradient Process in Hilbert Spaces, Journal of Mathematical Analysis and Applications, Vol. 53, pp. 145–158, 1976.

    Google Scholar 

  3. Lemaire, B., The Proximal Algorithm, International Series of Numerical Mathematics, Birkhäuser Verlag, Basel, Switzerland, Vol. 87, pp. 73–87, 1989.

    Google Scholar 

  4. Eckstein, J., and Bertsekas, D. P., On the Douglas-Rachford Splitting Method and the Proximal Point Algorithm for Maximal Monotone Operators, Mathematical Programming, Vol. 55, pp. 293–318, 1992.

    Google Scholar 

  5. Zhu, D., and Marcotte, P., New Classes of Generalized Monotonicity, Journal of Optimization Theory and Applications, Vol. 87, pp. 457–471, 1995.

    Google Scholar 

  6. Rockafellar, R. T., Monotone Operators and the Proximal Point Algorithm, SIAM Journal of Control and Optimization, Vol. 14, pp. 877–898, 1976.

    Google Scholar 

  7. Baillon, J. B., and Haddad, G., Quelques Propriétés des Opérateurs Angles-Bornés et n-Cycliquement Monotones, Israel Journal of Mathematics, Vol. 26, pp. 137–150, 1977.

    Google Scholar 

  8. Nesterov, Y., Private Communication to C. Lemaréchal, INRIA, Rocquencourt, France, 1993.

  9. Hiriart-Urruty, J. B., and LemarÉchal, C., Convex Analysis and Minimization Algorithms, Springer Verlag, Berlin, Germany, 1993

    Google Scholar 

  10. Martinet, B., Algorithmes pour la Résolution de Problémes of d'Optimisation et de Minimax, Thesis Dissertation, University of Grenoble, Grenoble, France, 1972.

  11. Rockafellar, R. T., Characterization of Subdifferentials of Convex Functions, Pacific Journal of Mathematics, Vol. 17, pp. 497–510, 1966.

    Google Scholar 

  12. Cartan, H., Cours de Calcul Différentiel, Collection Méthodes, Hermann, Paris, France, 1977.

    Google Scholar 

  13. Cohen, G., Optimization by Decomposition and Coordination: A Unified Approach, IEEE Transactions on Automatic Control, Vol. 23, pp. 222–232, 1978.

    Google Scholar 

  14. Cohen, G., Auxiliary Problem Principle and Decomposition of Optimization Problems, Journal of Optimization Theory and Applications, Vol. 32, pp. 277–305, 1980.

    Google Scholar 

  15. Cohen, G., Auxiliary Problem Principle Extended to Variational Inequalities, Journal of Optimization Theory and Applications, Vol. 59, pp. 369–390, 1988.

    Google Scholar 

  16. Luenberger, D. G., Linear and Nonlinear Programming, 2nd Edition, Addison-Wesley, Reading, Massachusetts, 1989.

    Google Scholar 

  17. Minoux, M., Programmation Mathématique, Vols. 1–2, Dunod, Paris, France, 1983.

    Google Scholar 

  18. Martinet, B., Régularisation d'Inéquations Variationnelles par Approximations Successives, Revue d'Automatique, d'Informatique et de Recherche Opérationnelle, Série Rouge, Vol. 3, pp. 154–159, 1970.

    Google Scholar 

  19. Rockafellar, R. T., Local Boundedness of Nonlinear Monotone Operators, Michigan Mathematics Journal, Vol. 16, pp. 397–407, 1969.

    Google Scholar 

  20. Barbu, V., and Precupanu, T., Convexity and Optimization in Banach Spaces, Mathematics and Its Applications, East European Series, D. Reidel Publishing Company, New York, New York, 1986.

    Google Scholar 

  21. Renaud, A., Algorithmes de Régularisation et de Décomposition pour les Problèmes Variationnels Monotones, Thesis Dissertation, École des Mines de Paris, Paris, France, 1993.

  22. Cohen, G., and Zhu, D. L., Decomposition Coordination Methods in Large-Scale Optimization Problems: The Nondifferentiable Case and the Use of Augmented Largrangian, Advances in Large-Scale Systems: Theory and Applications, Edited by J. B. Cruz, JAI Press, Greenwich, Connecticut, Vol. 1, pp. 203–266, 1984.

    Google Scholar 

  23. Spingarn, J. E., Partial Inverse of a Monotone Operator, Applied Mathematics and Optimization, Vol. 10, pp. 247–265, 1983.

    Google Scholar 

  24. Spingarn, J. E., Application of the Method of Partial Inverses to Convex Programming: Decomposition, Mathematical Programming, Vol. 32, pp. 199–223, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Électricité de France, Direction des Études et Recherches, Service Études de Réseaux, Clamart, France

    A. Renaud

  2. Centre Automatique et Systèmes, École des Mines de Paris, France

    G. Cohen

  3. INRIA, Rocquencourt, France

    G. Cohen

Authors
  1. A. Renaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Renaud, A., Cohen, G. Conditioning and Regularization of Nonsymmetric Operators. Journal of Optimization Theory and Applications 92, 127–148 (1997). https://doi.org/10.1023/A:1022692114480

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022692114480

Search

Navigation