Lagrangian Optimization Methods for Nonlinear Programming
Angelia Nedić
Abstract
Angelia Nedić
Abstract
Abstract This article provides an overview of Lagrangian relaxation and its duality theory as applied to nonlinear optimization problems. Basic duality properties and Lagrangian saddle point results are discussed. Also, the algorithms for solving saddle point problems and dual problems are surveyed.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract This article provides an overview of Lagrangian relaxation and its duality theory as applied to nonlinear optimization problems. Basic duality properties and Lagrangian saddle point results are discussed. Also, the algorithms for solving saddle point problems and dual problems are surveyed.
Key concepts: Lagrangian relaxation, Lagrangian, Saddle point, Duality (order theory), Saddle, Nonlinear programming, Nonlinear system, Mathematical optimization