Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
From MaRDI portal
Publication:639941
DOI10.1007/s10957-011-9844-0zbMath1229.90210OpenAlexW2089820648MaRDI QIDQ639941
Publication date: 11 October 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9844-0
optimality conditionsseparation theoremquasi-relative interiorgeneralized subconvexlike set-valued map
Related Items (12)
Characterizations of improvement sets via quasi interior and applications in vector optimization ⋮ On optimality conditions for quasi-relative efficient solutions in set-valued optimization ⋮ Image convexity of generalized systems with infinite-dimensional image and applications ⋮ Set-valued systems with infinite-dimensional image and applications ⋮ Refinements on gap functions and optimality conditions for vector quasi-equilibrium problems via image space analysis ⋮ A kind of equivalence of three nonlinear scalarization functions in vector optimization ⋮ Higher-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization with nonsolid ordering cones ⋮ Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems ⋮ Duality and its applications to optimality conditions with nonsolid cones ⋮ Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone ⋮ On the use of the quasi-relative interior in optimization ⋮ The connectedness of the solutions set for set-valued vector equilibrium problems under improvement sets
Cites Work
- Unnamed Item
- Unnamed Item
- Nearly subconvexlike set-valued maps and vector optimization problems
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Generalizations of Slater's constraint qualification for infinite convex programs
- A theorem of the alternative and its application to the optimization of set-valued maps
- Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
- Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds
- Notions of relative interior in Banach spaces
- Near-subconvexlikeness in vector optimization with set-valued functions
- Separation theorem based on the quasirelative interior and application to duality theory
- Benson proper efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions.
- Theorems of the alternative and optimization with set-valued maps
- Infinite dimensional duality and applications
- Duality in Vector Optimization
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Proper Efficient Points for Maximizations with Respect to Cones
- ON A SEPARATION THEOREM INVOLVING THE QUASI-RELATIVE INTERIOR
This page was built for publication: Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
