Invex-convexlike functions and duality
From MaRDI portal
Publication:1906754
DOI10.1007/BF02192045zbMath0843.90109OpenAlexW2018036318MaRDI QIDQ1906754
Publication date: 6 February 1996
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02192045
Nonlinear programming (90C30) Convexity of real functions of several variables, generalizations (26B25)
Related Items (9)
Using \(\rho \)-cone arcwise connectedness on parametric set-valued optimization problems ⋮ Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions ⋮ Weak Fenchel and weak Fenchel-Lagrange conjugate duality for nonconvex scalar optimization problems ⋮ PARAMETRIC SET-VALUED OPTIMIZATION PROBLEMS UNDER GENERALIZED CONE CONVEXITY ⋮ Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials ⋮ On the optimization properties of the correntropic loss function in data analysis ⋮ Generalized convexity in multiobjective programming ⋮ Generalized convexity and efficiency for non-regular multiobjective programming problems with inequality-type constraints ⋮ Invexity and the Kuhn-Tucker theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On necessary optimality conditions in vector optimization problems
- On necessary and sufficient conditions in vector optimization
- Pre-invex functions in multiple objective optimization
- On sufficiency of the Kuhn-Tucker conditions
- Zero duality gaps in infinite-dimensional programming
- Proper solutions of vector optimization problems
- A modified wolfe dual for weak vector minimization
- Nonsmooth invexity
- Convexlike alternative theorems and mathematical programming
- What is invexity?
- Necessary and sufficient conditions in constrained optimization
- Generalized invexity for nonsmooth vector-valued mappings
- Minimax Theorems
This page was built for publication: Invex-convexlike functions and duality
