Invex-convexlike functions and duality
From MaRDI portal
Publication:1906754
DOI10.1007/BF02192045zbMATH Open0843.90109OpenAlexW2018036318MaRDI QIDQ1906754FDOQ1906754
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
Recommendations
- scientific article; zbMATH DE number 3902413
- Invex multifunctions and duality
- A dual generalization of convex functions
- Invex generalizations of some duality results
- Almost convex functions: conjugacy and duality
- Invexity and generalized convexity
- Convex conjugation and duality for the solutions of a functional equation
- ρ-Invex Functions and ( F , ρ)Convex Functions: Properties and Equivalences
- Generalized convex functionals and some duality results
- scientific article; zbMATH DE number 18875
Nonlinear programming (90C30) Convexity of real functions of several variables, generalizations (26B25)
Cites Work
- Pre-invex functions in multiple objective optimization
- Title not available (Why is that?)
- On sufficiency of the Kuhn-Tucker conditions
- Proper solutions of vector optimization problems
- Nonsmooth invexity
- What is invexity?
- Necessary and sufficient conditions in constrained optimization
- Title not available (Why is that?)
- Minimax Theorems
- Title not available (Why is that?)
- Convexlike alternative theorems and mathematical programming
- Zero duality gaps in infinite-dimensional programming
- Generalized invexity for nonsmooth vector-valued mappings
- On necessary optimality conditions in vector optimization problems
- On necessary and sufficient conditions in vector optimization
- Title not available (Why is that?)
- A modified wolfe dual for weak vector minimization
Cited In (10)
- Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials
- Title not available (Why is that?)
- On the optimization properties of the correntropic loss function in data analysis
- Generalized convexity in multiobjective programming
- PARAMETRIC SET-VALUED OPTIMIZATION PROBLEMS UNDER GENERALIZED CONE CONVEXITY
- Generalized convexity and efficiency for non-regular multiobjective programming problems with inequality-type constraints
- Invexity and the Kuhn-Tucker theorem
- Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions
- Using \(\rho \)-cone arcwise connectedness on parametric set-valued optimization problems
- Weak Fenchel and weak Fenchel-Lagrange conjugate duality for nonconvex scalar optimization problems
This page was built for publication: Invex-convexlike functions and duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906754)
