
handle: 10281/28657
The authors study optimality conditions for extremum problems to be of infinite-dimensional image by the image space approach by means of associating to the feasible set a special multifunction whose values are given by suitable subsets of a finite-dimensional space. The existence of a selection of the image multifunction whose range has an empty intersection with a suitable subset in the image space will be an optimality condition for the problem. Analyses on the selection multipliers are also given.
Programming in abstract spaces, necessary optimality conditions, Lagrange multipliers, Image space, Lagrange multipliers, Multifunctions, Necessary optimality conditions, Nonsmooth optimization, image space approach, multifunction, selection multipliers, Nonsmooth analysis, Optimality conditions and duality in mathematical programming, Optimality conditions for problems in abstract spaces
Programming in abstract spaces, necessary optimality conditions, Lagrange multipliers, Image space, Lagrange multipliers, Multifunctions, Necessary optimality conditions, Nonsmooth optimization, image space approach, multifunction, selection multipliers, Nonsmooth analysis, Optimality conditions and duality in mathematical programming, Optimality conditions for problems in abstract spaces
| 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). | 3 | |
| 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). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
