Nonsmooth invex functions and sufficient optimality conditions

DOI10.1006/jmaa.2000.7263zbMath1017.90080OpenAlexW2044441450MaRDI QIDQ5929382

Marco Castellani

Publication date: 6 June 2001

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.2000.7263

zbMATH Keywords

optimality conditionsnonlinear programming\(K\)-directional derivativenon-smooth invex functionsweak and strong duality theorems

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)

Related Items (6)

Characterization of solution sets of quasiconvex programs ⋮ Optimality criteria and duality in multiobjective programming involving nonsmooth invex functions ⋮ Local cone approximations in mathematical programming ⋮ Multiobjective Problems with Nonsmooth Equality Constraints ⋮ Optimality and duality for nonsmooth multiobjective fractional programming problems involving exponential \(V\)-\(r\)-invexity ⋮ Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems

Cites Work

• Optimality criteria in nonlinear programming involving nonconvex functions
• On sufficiency of the Kuhn-Tucker conditions
• \(D\)-invexity and optimality conditions
• A Farkas lemma for difference sublinear systems and quasidifferentiable programming
• A note on the relationships between convexity and invexity
• Nonsmooth invexity
• What is invexity?
• On optimality conditions in nonsmooth inequality constrained minimization
• Isotone tangent cones and nonsmooth optimization
• Invex functions and constrained local minima
• On optimality conditions in nondifferentiable programming
• Generalized Nonsmooth Invexity
• Local second-order approximations and applications in optimization
• Various types of nonsmooth invex functions
• Directional Derivative Calculus and Optimality Conditions in Nonsmooth Mathematical Programming
• First–order cone apporximations and necessary optimality conditions
• Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions
• Sufficient conditions for extremum, penalty functions and regularity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nonsmooth invex functions and sufficient optimality conditions