Convex Optimization: Saddle Points Characterization and Introduction to Duality

Giorgio Giorgi (), Bienvenido Jiménez () and Vicente Novo ()
Additional contact information
Giorgio Giorgi: University of Pavia
Bienvenido Jiménez: National University of Distance Education
Vicente Novo: National University of Distance Education

Chapter Chapter 8 in Basic Mathematical Programming Theory, 2023, pp 243-273 from Springer

Abstract: Abstract In the last 50 years or more, the words “nonsmooth optimization” generally refer to nonlinear programming problems (or also to problems of calculus of variations or optimal control) where the functions involved are not differentiable (in the sense of Fré chet), but satisfy weaker assumptions concerning various kinds of limits in various kinds of differential quotients, in order to obtain generalized gradients or generalized directional derivatives.

Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-031-30324-1_8

Ordering information: This item can be ordered from
http://www.springer.com/9783031303241

DOI: 10.1007/978-3-031-30324-1_8

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().