Characterizations of the Solution Sets and Sufficient Optimality Criteria via Higher-Order Strong Convexity

DOI10.1007/978-1-4419-9640-4_14zbMATH Open1247.90282OpenAlexW100328193MaRDI QIDQ2912158FDOQ2912158

Guneet Bhatia, Anjana Gupta, Pooja Arora

Publication date: 14 September 2012

Published in: Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4419-9640-4_14

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Title not available (Why is that?)
• Characterizations of strict local minima and necessary conditions for weak sharp minima
• Stability in Mathematical Programming with Nondifferentiable Data
• Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions
• Strict efficiency in vector optimization
• Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints
• Seven kinds of monotone maps

Cited In (1)

• Sufficient optimality conditions and duality for nonsmooth multiobjective optimization problems via higher order strong convexity

This page was built for publication: Characterizations of the Solution Sets and Sufficient Optimality Criteria via Higher-Order Strong Convexity

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