Solving Optimization Problems via Lagrangian Decomposition

Gonzalo E. Constante-Flores and Antonio J. Conejo
Additional contact information
Gonzalo E. Constante-Flores: Purdue University
Antonio J. Conejo: The Ohio State University

Chapter Chapter 6 in Optimization via Relaxation and Decomposition, 2025, pp 149-192 from Springer

Abstract: Abstract This chapter considers large-scale optimization problems with complicating constraints that can be addressed using Lagrangian decomposition algorithms. Complicating constraints are constraints that if ignored (relaxed) render a decomposable problem, that is, a problem that decomposes into several subproblems. Lagrangian decomposition algorithms decompose the original problem via Lagrangian functions or augmented Lagrangian functions and rely on an iterative procedure to obtain the solution of the original problem by iteratively solving the subproblems resulting from the decomposition. We first introduce the structure of problems with complicating constraints, summarize well-known facts of duality theory that are relevant for the algorithms considered, derive multiplier updating rules if a Lagrangian or an augmented Lagrangian function is used (which is the most common approach), and briefly describe alternative Lagrangian decomposition algorithms. We then consider the optimality conditions decomposition (OCD) algorithm in detail, and the augmented Lagrangian decomposition (ALD) algorithm, also called the alternating direction method of multipliers. We conclude with some final remarks.

Keywords: Complicating constraints; Lagrangian relaxation; Augmented Lagrangian relaxation (search for similar items in EconPapers)
Date: 2025
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-87405-5_6

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

DOI: 10.1007/978-3-031-87405-5_6

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