Abstract
Recent studies are concerned with two types of questions in nonconvex optimization: (a) conditions for having bounded Lagrange multipliers, Refs. 1–2; (b) a priori bounds for such Lagrange multipliers, Ref. 3. Such topics have been investigated under suitable regularity assumptions. The purpose of this paper is to study the same problems for the generalized Lagrange multipliers of a locally Lipschitz programming.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gauvin, J.,A Necessary and Sufficient Regularity Condition to Have Bounded Multipliers in Nonconvex Programming, Mathematical Programming, Vol. 12, pp. 136–138, 1977.
Nguyen, V. H., Strodiot, J. J., andMifflin, R.,On Conditions to Have Bounded Multipliers in Locally Lipschitz Programming, Mathematical Programming, Vol. 18, pp. 100–106, 1980.
Mangasarian, O. L.,Computable Numerical Bounds for Lagrange Multipliers of Stationary Points of Nonconvex Differentiable Nonlinear Programs, Operations Research Letters, Vol. 4, pp. 47–48, 1985.
Clarke, F. H.,Optimization and Nonsmooth Analysis, Wiley, New York, New York, 1983.
Hiriart-Urruty, J. B.,Refinements of Necessary Optimality Conditions in Nondifferentiable Programming, I, Applied Mathematics and Optimization, Vol. 5, pp. 63–82, 1979.
Author information
Authors and Affiliations
Additional information
Communicated by O. L. Mangasarian
The author thanks the referees for helpful suggestions
Rights and permissions
About this article
Cite this article
Pappalardo, M. Error bounds for generalized Lagrange multipliers in locally Lipschitz programming. J Optim Theory Appl 73, 205–210 (1992). https://doi.org/10.1007/BF00940086
Issue Date:
DOI: https://doi.org/10.1007/BF00940086