Skip to main content
Log in

Symbolic Fenchel Conjugation

  • FULL LENGTH PAPER
  • Published:
Mathematical Programming Submit manuscript

Abstract

Of key importance in convex analysis and optimization is the notion of duality, and in particular that of Fenchel duality. This work explores improvements to existing algorithms for the symbolic calculation of subdifferentials and Fenchel conjugates of convex functions defined on the real line. More importantly, these algorithms are extended to enable the symbolic calculation of Fenchel conjugates on a class of real-valued functions defined on \(\mathbb{R}^n\). These algorithms are realized in the form of the Maple package SCAT.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ahlfors L. (1966). Complex Analysis. McGraw-Hill, New York

    MATH  Google Scholar 

  2. Auslender A. and Teboulle M. (2003). Asymptotic Cones and Functions in Optimization and Variational Inequalities. Springer, Berlin

    MATH  Google Scholar 

  3. Bauschke, H., Mohrenschildt, M.v.: Fenchel conjugates and subdifferentiation in Maple. In: Technical Report CORR 97-23, Department of Combinatorics and Optimization, University of Waterloo (1997)

  4. Bauschke, H., Mohrenschildt, M.v.: Symbolic computation of Fenchel conjugates. ACM SIGSAM bulletin (2005) (to appear)

  5. Borwein J. and Lewis A. (2000). Convex Analysis and Nonlinear Optimization CMS Books in Mathematics. Springer, New York

    Google Scholar 

  6. Borwein, J., Maréchal, P., Naugler, D.: A convex dual approach to the computation of NMR complex spectra. Math. Meth. Oper. Res. 51(1), 91–102 (2000). URL: http://locutus.cs.dal.ca:8088/archive/ 00000207/

  7. Boyd S. and Vandenberghe L. (2004). Convex Optimization. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  8. Hamilton, C.: Symbolic convex analysis. Master’s thesis, Department of Mathematics and Statistics, Simon Fraser University (2005)

  9. Hoch J., Stern A., Donoho D. and Johnstone I. (1990). Maximum entropy reconstruction of complex (phase-sensitive) spectra. J. Magn. Reson. 86: 236–246

    Google Scholar 

  10. Lucet Y. (1996). A fast computational algorithm for the Legendre–Fenchel transform. Comput. Optim. Appl. 6(1): 27–57

    Article  MATH  MathSciNet  Google Scholar 

  11. Lucet Y. (1997). Faster than the fast Legendre transform, the linear-time Legendre transform. Numer. Algorithms 16: 171–185

    Article  MATH  MathSciNet  Google Scholar 

  12. Luenberger D. (1969). Optimization by Vector Space Methods Series in Decision and Control. Wiley, New York

    MATH  Google Scholar 

  13. Rockafellar R. (1970). Convex Analysis. Princeton University Press, Princeton

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jonathan M. Borwein.

Additional information

In honour of Alfred Auslender.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Borwein, J.M., Hamilton, C.H. Symbolic Fenchel Conjugation. Math. Program. 116, 17–35 (2009). https://doi.org/10.1007/s10107-007-0134-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-007-0134-4

Keywords

Mathematics Subject Classification (2000)

Navigation