Files in this item



application/pdf9210879.pdf (4MB)Restricted to U of Illinois
(no description provided)PDF


Title:Quasiconvex optimization via generalized gradients and symmetric duality
Author(s):Kugendran, Thambithurai
Doctoral Committee Chair(s):McLinden, Lynn
Department / Program:Mathematics
Degree Granting Institution:University of Illinois at Urbana-Champaign
Abstract:Nondifferentiable 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.
In the second part, the Passy-Prisman symmetric perturbational duality scheme for quasiconvex minimization problems is developed in a manner that is more complete than that of Passy-Prisman. This scheme is then utilized to derive minimax results for quasisaddle functions, including in particular a slight extension of Sion's minimax theorem in finite dimensions. This approach to developing quasisaddle minimax results had been observed by Passy and Prisman, but their proofs had several crucial gaps. The development given here fills in the gaps and thus completes the proofs.
Issue Date:1991
Rights Information:Copyright 1991 Kugendran, Thambithurai
Date Available in IDEALS:2011-05-07
Identifier in Online Catalog:AAI9210879
OCLC Identifier:(UMI)AAI9210879

This item appears in the following Collection(s)

Item Statistics