Advertisement

Appendix B: Some Concepts and Results from Convex Analysis

  • Sławomir Stańczak
  • Marcin Wiczanowski
  • Holger Boche
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4000)

Abstract

In this chapter, we collect definitions, notational conventions and several results from convex analysis that may be helpful in better understanding the material covered in this manuscript. Proofs are provided only for selected results concerning the notion of log-convexity and the convergence of gradient projection algorithms. For other proofs, the reader is referred to any standard analysis book (e.g., [98]) and [83, 88, 11].

Keywords

Convex Function Open Interval Open Cover Strict Inequality Convex Analysis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Sławomir Stańczak
    • Marcin Wiczanowski
      • Holger Boche

        There are no affiliations available

        Personalised recommendations