Optimality conditions and Toland's duality for a nonconvex minimization problem
Keywords:
DC-minimization, optimality conditions, Toland's duality, fractional programmation, partial orderSubjects:
49K27, 90C25Abstract
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.
Downloads
Published
2003-04-15
Issue
Section
Articles
License
Copyright (c) 2003 Authors retain copyright to their work.
This work is licensed under a Creative Commons Attribution 4.0 International License.