Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization
From MaRDI portal
Publication:2182861
DOI10.1007/s10898-020-00893-0zbMath1453.90128OpenAlexW3007124851MaRDI QIDQ2182861
Nader Kanzi, Majid Soleimani-damaneh
Publication date: 26 May 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00893-0
nonsmooth optimizationoptimality conditionsmultiobjective programmingquasiconvex functionconstraint qualification
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52)
Related Items
Optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems on Hadamard manifolds ⋮ Semistrictly and neatly quasiconvex programming using lower global subdifferentials ⋮ Optimality and duality for \(E\)-differentiable multiobjective programming problems involving \(E\)-type I functions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion ⋮ Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robustness in nonsmooth nonlinear multi-objective programming
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- Lower subdifferentiable functions and their minimization by cutting planes
- Convex analysis and nonlinear optimization. Theory and examples.
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
- About differentiability of order one of quasiconvex functions on \(R^ n\).
- Characterization of solution sets of quasiconvex programs
- Robustness in deterministic vector optimization
- Infinite alternative theorems and nonsmooth constraint qualification conditions
- An operational test for the existence of a consistent increasing quasi-concave value function
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Characterization of solution sets of convex programs
- An Appropriate Subdifferential for Quasiconvex Functions
- Introduction to Nonsmooth Optimization
- Functional Analysis, Calculus of Variations and Optimal Control
- Optimality Conditions for Quasiconvex Programs
- Variational Analysis and Applications
- Surrogate Programming and Multipliers in Quasi-convex Programming
- What is quasiconvex analysis?
- Multicriteria Optimization
- On Quasi-Convex Duality
This page was built for publication: Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization
