Skip to main content
SpringerLink
Log in

An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

We introduce an entropy-like proximal algorithm for the problem of minimizing a closed proper convex function subject to symmetric cone constraints. The algorithm is based on a distance-like function that is an extension of the Kullback-Leiber relative entropy to the setting of symmetric cones. Like the proximal algorithms for convex programming with nonnegative orthant cone constraints, we show that, under some mild assumptions, the sequence generated by the proposed algorithm is bounded and every accumulation point is a solution of the considered problem. In addition, we also present a dual application of the proposed algorithm to the symmetric cone linear program, leading to a multiplier method which is shown to possess similar properties as the exponential multiplier method (Tseng and Bertsekas in Math. Program. 60:1–19, 1993) holds.

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. Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. 95, 3–51 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Baes, M.: Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras. Linear Algebra Appl. 422, 664–700 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bertsekas, D.: Constrained Optimization and Lagrange Multiplier Methods. Academic Press, New York (1982)

    Google Scholar 

  4. Chen, G., Teboulle, M.: Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3, 538–543 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Censor, Y., Zenios, S.A.: The proximal minimization algorithm with D-functions. J. Optim. Theory Appl. 73, 451–464 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  6. Doljansky, M., Teboulle, M.: An interior proximal algorithm and the exponential multiplier method for semidefinite programming. SIAM J. Optim. 9, 1–13 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  7. Eckstein, J.: Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming. Math. Oper. Res. 18, 206–226 (1993)

    Article  MathSciNet  Google Scholar 

  8. Eggermont, P.B.: Multilicative iterative algorithms for convex programming. Linear Algebra Appl. 130, 25–42 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  9. Faybusovich, L.: Euclidean Jordan algebras and interior point algorithm. Positivity 1, 331–357 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  10. Faybusovich, L.: Linear systems in Jordan algebras and primal-dual interior point algorithm. J. Comput. Appl. Math. 86, 149–175 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  11. Faraut, J., Korányi, A.: Analysis on Symmetric Cones. Oxford Mathematical Monographs. Oxford University Press, New York (1994)

    MATH  Google Scholar 

  12. Guler, O.: On the convergence of the proximal point algorithm for convex minimization. SIAM J. Control Optim. 29, 403–419 (1991)

    Article  MathSciNet  Google Scholar 

  13. Iusem, A., Teboulle, M.: Convergence rate analysis of nonquadratic proximal method for convex and linear programming. Math. Oper. Res. 20, 657–677 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  14. Iusem, A., Svaiter, B., Teboulle, M.: Entropy-like proximal methods in convex programming. Math. Oper. Res. 19, 790–814 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  15. Koecher, M.: In: Brieg, A., Walcher, S. (eds.) The Minnesota Notes on Jordan Algebras and Their Applications. Springer, Berlin (1999)

    Google Scholar 

  16. Lobo, M.S., Vandenberghe, L., Boyd, S., Lebret, H.: Application of second-order cone programming. Linear Algebra Appl. 284, 193–228 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  17. Martinet, B.: Perturbation des methodes d’optimisation. Appl. RAIRO Numer. Anal. (1978)

  18. Moreau, J.J.: Promimité et dualité dans un espace hilbertien. Bull. Soc. Math. Fr. 93, 273–299 (1965)

    MATH  MathSciNet  Google Scholar 

  19. Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)

    MATH  Google Scholar 

  20. Rockafellar, R.T.: Augmented lagrangians and applications of proximal point algorithm in convex programming. Math. Oper. Res. 1, 97–116 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  21. Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877–898 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  22. Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998)

    Book  MATH  Google Scholar 

  23. Schmieta, S.H., Alizadeh, F.: Extension of primal-dual interior point algorithms to symmetric cones. Math. Program. 96, 409–438 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  24. Sun, D., Sun, J.: Löwner’s operator and spectral functions on Euclidean Jordan algebras, Math. Oper. Res. (2004, submitted)

  25. Teboulle, M.: Entropic proximal mappings with applications to nonlinear programming. Math. Oper. Res. 17, 670–690 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  26. Teboulle, M.: Convergence of proximal-like algorithms. SIAM J. Optim. 7, 1069–1083 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  27. Tseng, P., Bertsekas, D.: On the convergence of the exponential multiplier method for convex programming. Math. Program. 60, 1–19 (1993)

    Article  MathSciNet  Google Scholar 

  28. Vandenberghe, L., Boyd, S.: A primal-dual potential reduction method for problems involving matrix inequalities. Math. Program. 69, 205–236 (1995)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, National Taiwan Normal University, Taipei, 11677, Taiwan

    Jein-Shan Chen

  2. School of Mathematical Sciences, South China University of Technology, Guangzhou, 510640, China

    Shaohua Pan

Authors
  1. Jein-Shan Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shaohua Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jein-Shan Chen.

Additional information

J.-S. Chen is a member of Mathematics Division, National Center for Theoretical Sciences, Taipei Office. The author’s work is partially supported by National Science Council of Taiwan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, JS., Pan, S. An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming. Comput Optim Appl 47, 477–499 (2010). https://doi.org/10.1007/s10589-008-9227-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-008-9227-0

Keywords

Search

Navigation