A class of nonlinear Lagrangians: Theory and algorithm

Indexed by:期刊论文

Journal:ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH

Included Journals:SCIE、EI

Volume:25

Issue:3

Page Number:327-371

ISSN No.:0217-5959

Key Words:nonconvex optimization; nonlinear Lagrangian; dual algorithm; condition number; dual function

Abstract:This paper establishes a theory framework of a class of nonlinear Lagrangians for solving nonlinear programming problems with inequality constraints. A set of conditions are proposed to guarantee the convergence of nonlinear Lagrangian algorithms, to analyze condition numbers of nonlinear Lagrangian Hessians as well as to develop the dual approaches. These conditions are satisfied by well-known nonlinear Lagrangians appearing in literature. The convergence theorem shows that the dual algorithm based on any nonlinear Lagrangian in the class is locally convergent when the penalty parameter is less than a threshold under a set of suitable conditions on problem functions and the error bound solution, depending on the penalty parameter, is also established. The paper also develops the dual problems based on the proposed nonlinear Lagrangians, and the related duality theorem and saddle point theorem are demonstrated. Furthermore, it is shown that the condition numbers of Lagrangian Hessians at optimal solutions are proportional to the controlling penalty parameters. We report some numerical results obtained by using nonlinear Lagrangians.

Date of Publication:2008-06-01