Characterizations of generalized Levitin-Polyak well-posed set optimization problems
From MaRDI portal
Publication:1733332
DOI10.1007/s11590-018-1258-6zbMath1448.90099OpenAlexW2799364199MaRDI QIDQ1733332
Publication date: 21 March 2019
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-018-1258-6
upper semicontinuityHausdorff convergencePainlevé-Kuratowski convergenceset optimizationLevitin-Polyak well-posednesscone-semicontinuitycone-quasiconvexity
Related Items (10)
Levitin-Polyak well-posedness for vector optimization problems in linear spaces ⋮ New concepts of directional derivatives for set-valued maps and applications to set optimization ⋮ A New Topological Framework and Its Application to Well-Posedness in Set-Valued Optimization ⋮ Connectedness of weak minimal solution set for set optimization problems ⋮ Existence and well-posedness for excess demand equilibrium problems ⋮ Generalized Levitin-Polyak well-posedness for controlled systems of FMQHI-fuzzy mixed quasi-hemivariational inequalities of Minty type ⋮ Well-posedness and stability in set optimization with applications ⋮ On Levitin-Polyak well-posedness and stability in set optimization ⋮ Levitin-Polyak well-posedness in set optimization concerning Pareto efficiency ⋮ Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized \(B\)-well-posedness for set optimization problems
- Pointwise well-posedness in set optimization with cone proper sets
- Scalarization and pointwise well-posedness for set optimization problems
- Convexity and global well-posedness in set-optimization
- Well-setness and scalarization in set optimization
- Nonconvex separation theorems and some applications in vector optimization
- Well-posed optimization problems
- Pointwise well-posedness and scalarization in set optimization
- Well-posedness for set optimization problems
- Topological structure of efficient set of optimization problem of set- valued mapping
- Extended well-posedness of optimization problems
- Pointwise and global well-posedness in set optimization: a direct approach
- Levitin-Polyak well-posedness for constrained quasiconvex vector optimization problems
- Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization
- Scalar characterizations of cone-continuous set-valued maps
- Well-posedness and stability of solutions for set optimization problems
- Scalarization of Levitin–Polyak well-posed set optimization problems
- Vector Optimization
- Variational Analysis
- Set-valued Optimization
- On the stability of the functional optimization problem
This page was built for publication: Characterizations of generalized Levitin-Polyak well-posed set optimization problems
