Abstract

This paper studies necessary and sufficinet conditions and provides a duality theory for a wide class of problems arising in nonconvex optimization, such as minimizing a difference of two convex functions subject to a convex vector constraint taking values in an ordered topological vector space. These results are then used to study a problem of nondifferentiable optimization.

Keywords: DC-minimization, optimality conditions, Toland's duality, fractional programmation, partial order.

MSC: 49K27, 90C25

Pages:  21--30     

Volume  55 ,  Issue  1$-$2 ,  2003