On the use of the quasi-relative interior in optimization
From MaRDI portal
Publication:2808318
Recommendations
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
- Quasi-relative interiors for graphs of convex set-valued mappings
- ON A SEPARATION THEOREM INVOLVING THE QUASI-RELATIVE INTERIOR
- Separation theorem based on the quasirelative interior and application to duality theory
Cites work
- A new necessary and sufficient condition for the strong duality and the infinite dimensional Lagrange multiplier rule
- Duality in Vector Optimization
- General infinite dimensional duality and applications to evolutionary network equilibrium problems
- Infinite dimensional duality and applications
- Non-convex strong duality via subdifferential
- Notions of relative interior in Banach spaces
- Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
- Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems
- Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds
- Quasi-relative interior-type constraint qualifications ensuring strong Lagrange duality for optimization problems with cone and affine constraints
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- Remarks on infinite dimensional duality
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- Separation theorem based on the quasirelative interior and application to duality theory
- Stable and total Fenchel duality for convex optimization problems in locally convex spaces
- The infinite dimensional Lagrange multiplier rule for convex optimization problems
- Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
Cited in
(18)- Fenchel–Rockafellar theorem in infinite dimensions via generalized relative interiors
- Face relative interior of convex sets in topological vector spaces
- Quasi-relative interiors for graphs of convex set-valued mappings
- Set-valued systems with infinite-dimensional image and applications
- Image convexity of generalized systems with infinite-dimensional image and applications
- Generalized relative interiors and generalized convexity in infinite-dimensional spaces
- Characterizations via linear scalarization of minimal and properly minimal elements
- On three open problems related to quasi relative interior
- On the intrinsic core of convex cones in real linear spaces
- scientific article; zbMATH DE number 7313247 (Why is no real title available?)
- On epsilon-stability in optimization
- Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems
- Relationships between polyhedral convex sets and generalized polyhedral convex sets
- On the global shape of convex functions on locally convex spaces
- The intrinsic core and minimal faces of convex sets in general vector spaces
- Finitely convergent iterative methods with overrelaxations revisited
- Infinite-dimensional vector optimization and a separation theorem
- Vector optimization w.r.t. relatively solid convex cones in real linear spaces
This page was built for publication: On the use of the quasi-relative interior in optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808318)
