Optimization Online


An Approximate Lagrange Multiplier Rule

Joydeep Dutta(jdutta***at***iitk.ac.in)
Suvendu Pattanaik(suvendu***at***iitk.ac.in)
Michel Thera(michel.thera***at***unilim.fr)

Abstract: In this paper, we show that for a large class of optimization problems, the Lagrange multiplier rule can be derived from the so-called approximate multiplier rule. In establishing the link between the approximate and the exact multiplier rule we first derive an approximate multiplier rule for a very general class of optimization problems using the approximate sum rule and the chain rule. We also provide a simple proof to the approximate chain rule based on a fundamental result in parametric optimization. In the end we derive a mixed approximate multiplier rule for an equality and inequality constrained optimization problem and outline an approach to use the mixed approximate multiplier rule in studying the computational aspect associated with such a problem.

Keywords: Lagrange multiplier rule, Locally Lipschitz functions, Subdifferential, composite optimization, nonsmooth calculus.

Category 1: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Citation: unpublished

Download: [PDF]

Entry Submitted: 06/04/2009
Entry Accepted: 06/04/2009
Entry Last Modified: 06/04/2009

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society