2011Wiley Encyclopedia of Operations Research and Management ScienceRequires access

Lagrangian Optimization Methods for Nonlinear Programming

Angelia Nedić

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Lagrangian relaxation, Lagrangian, Saddle point, Duality (order theory), Saddle, Nonlinear programming, Nonlinear system, Mathematical optimization

Related papers

Back to paper searchBrowse research topicsOriginal source
Lagrangian Optimization Methods for Nonlinear Programming — Research Paper | ScholarLens