Skip to main content

A Convex Optimization Toolbox

  • Chapter
  • First Online:
Convex and Stochastic Optimization

Part of the book series: Universitext ((UTX))

  • 3166 Accesses

Abstract

This chapter presents the duality theory for optimization problems, by both the minimax and perturbation approach, in a Banach space setting. Under some stability (qualification) hypotheses, it is shown that the dual problem has a nonempty and bounded set of solutions. This leads to the subdifferential calculus, which appears to be nothing but a partial subdifferential rule. Applications are provided to the infimal convolution, as well as recession and perspective functions. The relaxation of some nonconvex problems is analyzed thanks to the Shapley–Folkman theorem.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 29.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 39.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Except maybe when the set is a singleton and then the dimension is zero, where this is a matter of definition. However the case when \(A-B\) reduces to a singleton means that both A and B are singletons and then it is easy to separate them.

  2. 2.

    Baire’s lemma tells us that any countable intersection of dense subsets in X is dense, or equivalently, that any countable union of closed sets with empty interiors has an empty interior.

  3. 3.

    Provided by Lionel Thibault, U. Montpellier II.

  4. 4.

    Not to be confused with the duality Lagrangian defined in (1.156).

  5. 5.

    If the minimal number of a nonnegative combination was greater than \(n+p\), adding some linear combination of these elements equal to 0 and with nonzero elements, we could easily find another nonnegative combination of z with fewer nonzero coefficients, which would give a contradiction.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to J. Frédéric Bonnans .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Bonnans, J.F. (2019). A Convex Optimization Toolbox. In: Convex and Stochastic Optimization. Universitext. Springer, Cham. https://doi.org/10.1007/978-3-030-14977-2_1

Download citation

Publish with us

Policies and ethics