On conditions to have bounded multipliers in locally lipschitz programming

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1980 Belgium English Publisher:Springer Science and Business Media LLCJournal:Mathematical Programming, volume 18, pages 100-106 (issn: 0025-5610, eissn: 1436-4646,

Copyright policy )

Authors: Nguyen, Van Hien; Strodiot, Jean-Jacques; Mifflin, Robert;

doi: 10.1007/bf01588302

On conditions to have bounded multipliers in locally lipschitz programming

- Summary
- Subjects
- Metrics

Abstract

For a nonlinear programming problem with locally Lipschitz objective and inequality constraint functions and continuously differentiable equality constraint functions, a necessary and sufficient condition is presented for the set of multiplier vectors to be nonempty and bounded.

Country

Belgium

Related Organizations

University of Namur
Belgium
Washington State University
United States

Keywords

set of multiplier vectors, bounded multipliers, continuously differentiable equality constraint functions, nonemptiness condition, nonsmooth optimization, boundedness condition, constraint qualification, Nonlinear programming, locally Lipschitz objective, inequality constraint functions, nondifferentiable programming, Kuhn-Tucker multipliers, necessary and sufficient condition

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	36
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%