# Modified Lagrangians in convex programming and their generalizations

## Abstract

In this paper a rather general class of modified Lagrangians is described for which the main results of the duality theory hold. Within this class two families of modified Lagrangians are taken into special consideration. The elements of the first family are characterized by so-called stability of saddle points and the elements of the second family generate smooth dual problems. The computational methods naturally connected with each of these two families are examined. Further a more general scheme is considered which exploits the idea of modification with respect to the problem of finding a root of a monotone operator. This scheme yields a unified approach to convex programming problems and to determination of saddle and equilibrium points as well as expands the class of modified Lagrangians.

## Key words

Modified Lagrangians Convex Programming Stability of Saddle Points Smooth Dual Problems Monotone Operator## Preview

Unable to display preview. Download preview PDF.

## References

- [1]E.G. Gol’shtein and N.V. Tret’yakov, “Modified Lagrangian functions”,
*Economics and Mathematical Methods*10 (3) (1974) 568–591 (in Russian).Google Scholar - [2]E.G. Gol’shtein and N.V. Tret’yakov, “The gradient method of minimization and algorithms of convex programming based on modified Lagrangian functions”,
*Economics and Mathematical Methods*11 (4) (1975) 730–742 (in Russian).Google Scholar - [3]E.G. Gol’shtein, “The modification method for monotone mappings”,
*Economics and Mathematical Methods*11 (6) (1975) 1144–1159 (in Russian).Google Scholar - [4]E.G. Gol’shtein,
*Theory of convex programming*, AMS Translation Series (1972), (Translation of a book in Russian edited by “Nauka”, Moscow, 1970).Google Scholar - [5]E.G. Gol’shtein, “The generalized gradient method for determination of saddle points”,
*Economics and Mathematical Methods*8 (4) (1972) 569–579 (in Russian).Google Scholar - [6]G.D. Maistrovskii, “On the gradient methods for determination of saddle points”,
*Economics and Mathematical Methods*12 (5) (1976) (in Russian).Google Scholar - [7]B.T. Polyak and N.V. Tret’yakov, “On an iterative method of linear programming and its economic interpretation”,
*Economics and Mathematical Methods*8 (5) (1972) 740–751 (in Russian).Google Scholar - [8]N.V. Tret’yakov, “The method of penalty prices for convex programming problems”,
*Economics and Mathematical Methods*9 (3) (1973) 525–540 (in Russian).MathSciNetGoogle Scholar - [9]R.T. Rockafellar, “A dual approach to solving nonlinear programming problems by unconstrained optimization”,
*Mathematical Programming*5 (3) (1973) 354–373.zbMATHCrossRefMathSciNetGoogle Scholar - [10]R.T. Rockafellar, “The multiplier method of Hestenes and Powell applied to convex programming”,
*Journal of Optimization Theory and Applications*12 (6) (1973) 555–562.zbMATHCrossRefMathSciNetGoogle Scholar - [11]B.W. Kort and D.P. Bertsekas, “Multiplier methods for convex programming”,
*Proceedings 1973 IEEE Conf. on Decision and Control*(San Diego, California) 428–432.Google Scholar - [12]B.W. Kort and D.P. Bertsekas, “Combined primal dual and penalty methods for convex programming”,
*SIAM Journal on Control and Optimization*14 (2) (1976) 268–294zbMATHCrossRefMathSciNetGoogle Scholar - [13]R.T. Rockafellar, “Monotone operators and the proximal point algorithm”,
*SIAM Journal on Control and Optimization*14 (5) (1976).Google Scholar - [14]R.T. Rockafellar, “Augmented Lagrangians and applications of the proximal point algorithm in convex programming”,
*Mathematics, of Operations Research*1 (2) (1976) 97–116.zbMATHCrossRefMathSciNetGoogle Scholar