Optimization Online


Nonsmooth cone-constrained optimization with applications to semi-infinite programming

Boris Mordukhovich (boris***at***math.wayne.edu)
Nghia Tran (nghia***at***math.wayne.edu)

Abstract: 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.

Keywords: Nonsmooth optimization, conic programming, semi-infinite programming

Category 1: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Category 2: Infinite Dimensional Optimization (Semi-infinite Programming )


Download: [PDF]

Entry Submitted: 03/19/2012
Entry Accepted: 03/19/2012
Entry Last Modified: 11/30/2013

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society