Gamma Active Constraints in Convex Semi-Infinite Programming

This thesis studies the problem of extending the concept of γ-active constraints to Convex Semi-Inαnite Programming. To achieve this goal, extensive knowledge of topology, convex analysis, real analysis and optimization is needed. We base ourselves on the deαnition and results shown in previous...

Full description

Bibliographic Details
Main Author: Zetina Villamor, Carlos Armando
Other Authors: Dr. Maxim Todorov Ivanov
Format: Others
Language:en
Published: Universidad de las Am��ricas Puebla 2011
Subjects:
Online Access:http://catarina.udlap.mx/u_dl_a/tales/documentos/mosl/zetina_v_ca/
Description
Summary:This thesis studies the problem of extending the concept of γ-active constraints to Convex Semi-Inαnite Programming. To achieve this goal, extensive knowledge of topology, convex analysis, real analysis and optimization is needed. We base ourselves on the deαnition and results shown in previous publications and present two approaches to extend this deαnition to the case of Convex Semi-Inαnite Programming. We also provide a comparison of the two approaches, where we state their limitations and advantages. Key Words: Semi-Inαnite Programming, Extended Active Constraints, Convex Program-ming, Optimality Conditions.