Approximate solutions for set optimization with an order cone that has nonempty quasirelative interiors

DOI10.1186/s13660-022-02834-9zbMath1509.90212OpenAlexW4288748444MaRDI QIDQ6038886

Publication date: 3 May 2023

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-022-02834-9

zbMATH Keywords

optimality condition set optimization approximate weakly efficient solution quasirelative interior

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Approximation methods and heuristics in mathematical programming (90C59) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

New order relations in set optimization
Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
Vectorization of set-valued maps with respect to total ordering cones and its applications to set-valued optimization problems
Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
Some properties of approximate solutions for vector optimization problem with set-valued functions
\(\epsilon\)-solutions in vector minimization problems
Epsilon efficiency
Partially finite convex programming. I: Quasi relative interiors and duality theory
Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
Partial order relations on family of sets and scalarizations for set optimization
Lipschitz continuity of approximate solution mappings to parametric generalized vector equilibrium problems
Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity
Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces
A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
Set relations and weak minimal solutions for nonconvex set optimization problems with applications
Levitin-Polyak well-posedness for set optimization problems involving set order relations
Properties of the nonlinear scalar functional and its applications to vector optimization problems
A unified minimal solution in set optimization
Connectedness of weak minimal solution set for set optimization problems
Regularity Conditions via Quasi-Relative Interior in Convex Programming
On cone convexity of set-valued maps
Existence theorems of set optimization with set-valued maps
New nonlinear separation theorems and applications in vector optimization
Set-valued analysis

This page was built for publication: Approximate solutions for set optimization with an order cone that has nonempty quasirelative interiors