Local cone approximations in mathematical programming

DOI10.1080/02331934.2014.929684MaRDI QIDQ2808311zbMATH OpenOpenAlexFDO

Authors Marco Castellani, Massimiliano Giuli, S. Nobakhtian, Massimo Pappalardo

Publication date 23 May 2016

Published in Optimization (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11568/876542

zbMATH Keywords

error boundmean value theoremoptimality conditionsdirectional \(K\)-epiderivativeslocal cone approximations

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Programming in abstract spaces (90C48)

Cites work

• A dual representation for proper positively homogeneous functions
• Abstract cone approximations and generalized differentiability in nonsmooth optimization
• Approximate mean value theorem for upper subderivatives
• Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions
• Directional \(K\)-epiderivatives and error bound
• First–order cone apporximations and necessary optimality conditions
• Local second-order approximations and applications in optimization
• Multiobjective Problems with Nonsmooth Equality Constraints
• Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems
• Nonsmooth invex functions and sufficient optimality conditions
• On constraint qualifications in nonlinear programming
• On sufficiency of the Kuhn-Tucker conditions
• Optimality criteria and duality in multiobjective programming involving nonsmooth invex functions

Cited in

(1)

• scientific article; zbMATH DE number 503162 (Why is no real title available?)

This page was built for publication: Local cone approximations in mathematical programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808311)