The paper is devoted to the study of general nonsmooth problems of cone-constrained optimization (or conic programming) important for various aspects of optimization theory and applications. Based on advanced constructions and techniques of variational analysis and generalized differentiation, we derive new necessary optimality conditions (in both ``exact" and ``fuzzy" forms) for nonsmooth conic programs, establish characterizations of well-posedness for cone-constrained systems, and develop new applications to semi-infinite programming.
Article
View Nonsmooth cone-constrained optimization with applications to semi-infinite programming