Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
From MaRDI portal
Publication:5413869
DOI10.1080/02331934.2013.775283zbMath1287.49037OpenAlexW2084832285MaRDI QIDQ5413869
Sorin-Mihai Grad, Emilia Loredana Pop
Publication date: 2 May 2014
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2013.775283
Convex programming (90C25) Multi-objective and goal programming (90C29) Duality theory (optimization) (49N15)
Related Items
Characterizations of improvement sets via quasi interior and applications in vector optimization ⋮ Image convexity of generalized systems with infinite-dimensional image and applications ⋮ Vector optimization w.r.t. relatively solid convex cones in real linear spaces ⋮ Inertial forward–backward methods for solving vector optimization problems ⋮ Complete characterizations of robust strong duality for robust vector optimization problems ⋮ Characterizations via linear scalarization of minimal and properly minimal elements ⋮ Two iterative processes generated by regular vector fields in Banach spaces ⋮ New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems ⋮ Descent methods with computational errors in Banach spaces ⋮ Proximal point method for a special class of nonconvex multiobjective optimization functions ⋮ Unnamed Item ⋮ On the use of the quasi-relative interior in optimization ⋮ New Farkas-type results for vector-valued functions: a non-abstract approach ⋮ On the Intrinsic Core of Convex Cones in Real Linear Spaces
Cites Work
- Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
- Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
- Equilibrium analysis in financial markets with countably many securities
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Separation theorem based on the quasirelative interior and application to duality theory
- The convexity of \(A\) and \(B\) assures \(\text{int} A + B = \text{int}(A + B)\)
- General infinite dimensional duality and applications to evolutionary network equilibrium problems
- Infinite dimensional duality and applications
- Gordan-Type Alternative Theorems and Vector Optimization Revisited
- Extended Pareto Optimality in Multiobjective Problems
- Duality in Vector Optimization
- On Efficient Solutions to Multiple Objective Mathematical Programs
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- An analysis of some dual problems in multiobjective optimization (I)
