A comparison of two approaches to second-order subdifferentiability concepts with application to optimality conditions

Simple item page
dc.contributor.authorEberhard, A.
dc.contributor.authorPearce, C.
dc.contributor.editorQi, L.
dc.contributor.editorTeo, K.
dc.contributor.editorYang, X.
dc.date.issued2005
dc.descriptionThe original publication is available at www.springerlink.com
dc.description.abstractThe graphical derivative and the coderivative when applied to the proximal subdifferential are in general not generated by a set of linear operators Nevertheless we find that in directions at which the subject (or subhessian) is supported, in a rank-1 sense, we have these supported operators interpolating the contingent cone. Thus under a prox-regularity assumption we are able to make a selection from the contingent graphical derivative in certain directions, using the exposed facets of a convex set of symmetric matrices. This allows us to make a comparison between some optimality conditions. A nonsmooth formulation of a standard smooth mathematical programming problem is used to derive a novel set of sufficient optimality conditions.
dc.identifier.citationApplied optimization - Optimization and control with applications, 2005 / Qi, L., Teo, K., Yang, X. (ed./s), pp.35-100
dc.identifier.doi10.1007/0-387-24255-4_2
dc.identifier.isbn0387242546
dc.identifier.urihttp://hdl.handle.net/2440/30455
dc.language.isoen
dc.publisherSpringer
dc.publisher.placeBerlin, Heidelberg
dc.relation.ispartofseriesApplied optimization ; 96
dc.source.urihttp://www.springerlink.com/content/v185270776k47h21/
dc.titleA comparison of two approaches to second-order subdifferentiability concepts with application to optimality conditions
dc.typeBook chapter
pubs.publication-statusPublished

Files

Collections

Mathematical Sciences publications