An ε-lagrange multiplier rule for a mathematical programming problem on Banach spaces
MetadataShow full item record
SubjectNondifferentiable programming; ε-minimal solutions; ε-Lagrinlge multiplier rule; Ekeland's variational principle
The aim of this paper is to extend the multiplier rule due to Clarke for a nondifferentiable mathematical programming problem on a Banach space to e-minimal (suboptimal) solutions of the problem. This seems to be useful above all for problems .Which have no optimal solution. Special cases which are already known can be derived very easy from the general ε-Lagrange multiplier rule, for example a result due to Ekeland for C1-problems. A saddle point version in the case of convex data and a simple example will be given.
Showing items related by title, author, creator and subject.
Janes, A; Russo, B; Zuliani, P; Succi, G (Springer, 2003)Pair Programming has been shown to increase communication and teamwork skills and to provide better code. The aim of this work is to show the efficacy of Pair Programming in transferring knowledge and skills over an ...
Chesani, F; Mello, P; Montali, M; Torroni, P (CEUR, 2008)The Service Oriented Architecture paradigm, and its implementation based on Web Services, have been the object of an intense research and standardization activity. One of the most challenging open research issues is the ...