Generalized invexity for nonsmooth vector-valued mappings
From MaRDI portal
Publication:4729627
DOI10.1080/01630568908816352zbMath0679.90071OpenAlexW2044433337MaRDI QIDQ4729627
Publication date: 1989
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630568908816352
optimality conditionsgeneralized Jacobiangeneralized gradientnonsmooth mappingweak and strong duality resultsnonsmooth invexitycone-constrained nondifferentiable programmingLipschitz vector-valued mappings
Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Set-valued maps in general topology (54C60) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)
Related Items
Nonsmooth vector-valued invex functions and applications, On locally Lipschitz vector-valued invex functions, Necessary optimality conditions with a modified subdifferential, Invexity of supremum and infimum functions, Strict lower semicontinuity of the level sets and invexity of a locally Lipschitz function, Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions, Invex-convexlike functions and duality, Invexity criteria for a class of vector-valued functions, Optimality and duality in vector optimization involving generalized type I functions over cones, On a nonsmooth vector optimization problem with generalized cone invexity, A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions], Vector critical points and cone efficiency in nonsmooth vector optimization, Generalized nonsmooth invexity over cones in vector optimization, Invex multifunctions and duality, Invexity: an updated survey and new results for nonsmooth functions, Invexity in multifunction optimization, Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints
Cites Work
- Unnamed Item
- The essence of invexity
- Optimality criteria in mathematical programming involving generalized invexity
- On sufficiency of the Kuhn-Tucker conditions
- Foundations of optimization
- Optimization and nonsmooth analysis
- Nondifferentiable optimization by smooth approximations
- What is invexity?
- Necessary and sufficient conditions in constrained optimization
- Invex functions and constrained local minima
- Continuity and Differentiability Properties of Convex Operators
- On optimality conditions in nondifferentiable programming