𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Supportably and weakly convex functionals with applications to approximation theory and nonlinear programming

✍ Scribed by M.Z Nashed

Publisher
Elsevier Science
Year
1967
Tongue
English
Weight
768 KB
Volume
18
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Quasi-convex functions and applications
Quasi-convex functions and applications to optimality conditions in nonlinear programming
✍ A. Hassouni; A. Jaddar πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 214 KB

## Communicated by F. Clarke Abstract--We establish necessary and sufficient optimality conditions for quasi-convex programming. First, we treat some properties of the normal cone to the level set of a lower semicontinuous quasi-convex function defined on a Banach space. Next, we get our condition

Linear functionals on nonlinear spaces a
Linear functionals on nonlinear spaces and applications to problems from viscoplasticity theory
✍ Waldemar Pompe πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 149 KB

## Abstract A classical result in the theory of monotone operators states that if __C__ is a reflexive Banach space, and an operator __A__: __C__β†’__C__^\*^ is monotone, semicontinuous and coercive, then __A__ is surjective. In this paper, we define the β€˜dual space’ __C__^\*^ of a convex, usually no

A convex programming problem in Banach s
A convex programming problem in Banach spaces and applications to optimum control theory
✍ R. Conti πŸ“‚ Article πŸ“… 1970 πŸ› Elsevier Science 🌐 English βš– 397 KB

A convex programming problem for a functional defined on a Banach space is solved, and necessary conditions are derived in the form of a maximum principle. Applications of the results are made to minimum final (or initial) distance and to minimum-effort problems connected with a control process desc