Local Duality and Dual Methods

David G. Luenberger and Yinyu Ye
Additional contact information
David G. Luenberger: Stanford University
Yinyu Ye: Stanford University

Chapter Chapter 14 in Linear and Nonlinear Programming, 2021, pp 487-524 from Springer

Abstract: Abstract We first derive a local duality theory for constrained nonconvex optimization, which is based on our earlier global duality theory and the Lagrangian relaxations. The variables of the local dual are again the Lagrange multipliers associated with the constraints in the primal problem—the original constrained optimization problem but restricted in the neighborhood of a primal solution under consideration.

Date: 2021
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-030-85450-8_14

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

DOI: 10.1007/978-3-030-85450-8_14

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 ().