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-0zbMATH Open1229.90210OpenAlexW2089820648MaRDI QIDQ639941FDOQ639941
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
Recommendations
- Optimality conditions of vector set-valued optimization problem involving relative interior
- Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces
- The optimality conditions of weakly efficient element for set-valued optimization problems based on quasi-relative interior
- The optimality conditions of weak efficient solutions for the optimization problem of a class of generalized convex set-valued mapping
- scientific article; zbMATH DE number 6165540
optimality conditionsseparation theoremquasi-relative interiorgeneralized subconvexlike set-valued map
Cites Work
- 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
- 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
- Near-subconvexlikeness in vector optimization with set-valued functions
- Separation theorem based on the quasirelative interior and application to duality theory
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Title not available (Why is that?)
- Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds
- Notions of relative interior in Banach spaces
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- Generalizations of Slater's constraint qualification for infinite convex programs
- Infinite dimensional duality and applications
- Proper Efficient Points for Maximizations with Respect to Cones
- Theorems of the alternative and optimization with set-valued maps
- Duality in Vector Optimization
- Benson proper efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions.
- Nearly subconvexlike set-valued maps and vector optimization problems
- Title not available (Why is that?)
- ON A SEPARATION THEOREM INVOLVING THE QUASI-RELATIVE INTERIOR
Cited In (18)
- Duality and its applications to optimality conditions with nonsolid cones
- Title not available (Why is that?)
- Characterizations of improvement sets via quasi interior and applications in vector optimization
- Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
- On optimality conditions for quasi-relative efficient solutions in set-valued optimization
- Set-valued systems with infinite-dimensional image and applications
- Image convexity of generalized systems with infinite-dimensional image and applications
- Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems
- Face relative interior of convex sets in topological vector spaces
- A kind of equivalence of three nonlinear scalarization functions in vector optimization
- Refinements on gap functions and optimality conditions for vector quasi-equilibrium problems via image space analysis
- Generalized relative interiors and generalized convexity in infinite-dimensional spaces
- Higher-order Karush-Kuhn-Tucker optimality conditions for set-valued optimization with nonsolid ordering cones
- The connectedness of the solutions set for set-valued vector equilibrium problems under improvement sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the use of the quasi-relative interior in optimization
- The derivative type optimality conditions of subpreinvex set-valued optimization
This page was built for publication: Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q639941)
