Characterizations of improvement sets via quasi interior and applications in vector optimization
From MaRDI portal
Publication:276329
DOI10.1007/s11590-015-0897-0zbMath1346.90757OpenAlexW2051854300MaRDI QIDQ276329
Wan Li Zhang, Ke Quan Zhao, Yuan Mei Xia
Publication date: 3 May 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0897-0
scalarizationvector optimization with set-valued mapsimprovement setsquasi interiorweak E-efficient solutions
Related Items (3)
A combined scalarization method for multi-objective optimization problems ⋮ Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones ⋮ Approximate solutions of vector optimization problems via improvement sets in real linear spaces
Cites Work
- Weak \(E\)-optimal solution in vector optimization
- Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior
- Vector optimization problems via improvement sets
- Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Revisiting some duality theorems via the quasirelative interior in convex optimization
- \(\epsilon\)-solutions in vector minimization problems
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Characterizations of the Benson proper efficiency for nonconvex vector optimization
- 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
- Characterizations of efficient and weakly efficient points in nonconvex vector optimization
- Improvement sets and vector optimization
- Characterizing efficiency on infinite-dimensional commodity spaces with ordering cones having possibly empty interior
- Scalarization in geometric and functional vector optimization revisited
- Vector optimization. Set-valued and variational analysis.
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- On three open problems related to quasi relative interior
- Dual Characterization and Scalarization for Benson Proper Efficiency
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- E-Benson proper efficiency in vector optimization
- Strong Duality in Cone Constrained Nonconvex Optimization
- Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
- e-weak minimal solutions of vector optimization problems with set-valued maps
This page was built for publication: Characterizations of improvement sets via quasi interior and applications in vector optimization
