Abstract
A convex Fréchet differentiable function is minimized subject to a certain hyperplane at a point if the function is minimized in all directions which are defined by a finite set of vectors. The proposed approach is different from the Lagrange multiplier approach. At the end of this paper, a linear program is formulated to solve the case when the above given convex function is quadratic.
Original language | English |
---|---|
Pages (from-to) | 290-296 |
Number of pages | 7 |
Journal | Journal of Mathematical Analysis and Applications |
Volume | 253 |
Issue number | 1 |
DOIs | |
State | Published - 1 Jan 2001 |
Keywords
- Convex function; Fréchet differentiable; quadratic programming