Back to results
University of Illinois at Urbana-Champaign
Quasiconvex optimization via generalized gradients and symmetric duality
Abstract
dc:descriptionNondifferentiable quasiconvex programming problems are studied using Clarke's subgradients. Several conditions sufficient for optimality are derived. Under certain regularity conditions on the constraint functions, we also prove that a modified version of the classical Karush-Kuhn-Tucker conditions is both necessary and sufficient for optimality. The results extend and strengthen some by Arrow and Enthoven and by Mangasarian.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mathematics
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2011
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Kugendran, Thambithurai
- Contributors dc:contributor
-
- McLinden, Lynn
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- Copyright 1991 Kugendran, Thambithurai
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
-
AAI9210879
(UMI)AAI9210879 - OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/22664