First–order cone apporximations and necessary optimality conditions

DOI10.1080/02331939508844133zbMath0842.90122OpenAlexW2008749418MaRDI QIDQ4859824

Marco Castellani, Massimo Pappalardo

Publication date: 7 January 1996

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939508844133

zbMATH Keywords

necessary optimality conditionsgeneralized derivativesduality theorytangent conesgeneralized first-order cone approximations

Mathematics Subject Classification ID

Nonlinear programming (90C30) Programming in abstract spaces (90C48) Optimality conditions for problems in abstract spaces (49K27)

Related Items (7)

Sufficient optimality conditions in nondifferentiable optimization^∗ ⋮ Separation of sets, Lagrange multipliers, and totally regular extremum problems ⋮ Local second-order approximations and applications in optimization ⋮ DirectionalK-epiderivatives and error bound ⋮ On constraint qualifications in nonlinear programming ⋮ Nonsmooth invex functions and sufficient optimality conditions ⋮ Local cone approximations in mathematical programming

Cites Work

• On convex sets in general position
• Optimization and nonsmooth analysis
• Isotone tangent cones and nonsmooth optimization
• Abstract cone approximations and generalized differentiability in nonsmooth optimization
• On optimality conditions in nondifferentiable programming
• Set-valued analysis
• Unnamed Item
• Unnamed Item

This page was built for publication: First–order cone apporximations and necessary optimality conditions