Characterizations of generalized Levitin-Polyak well-posed set optimization problems
DOI10.1007/S11590-018-1258-6zbMATH Open1448.90099OpenAlexW2799364199MaRDI QIDQ1733332FDOQ1733332
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
set optimizationupper semicontinuityLevitin-Polyak well-posedness[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Painlev%EF%BF%BD%EF%BF%BD-Kuratowski+convergence&go=Go Painlev��-Kuratowski convergence]Hausdorff convergencecone-semicontinuitycone-quasiconvexity
Cites Work
- Variational Analysis
- Well-posedness for set optimization problems
- Vector Optimization
- Title not available (Why is that?)
- Generalized \(B\)-well-posedness for set optimization problems
- Scalarization and pointwise well-posedness for set optimization problems
- Convexity and global well-posedness in set-optimization
- Set-valued Optimization
- On the stability of the functional optimization problem
- Nonconvex separation theorems and some applications in vector optimization
- Well-posed optimization problems
- Extended well-posedness of optimization problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pointwise well-posedness in set optimization with cone proper sets
- Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization
- Pointwise well-posedness and scalarization in set optimization
- Well-posedness and stability of solutions for set optimization problems
- Pointwise and global well-posedness in set optimization: a direct approach
- Title not available (Why is that?)
- Well-setness and scalarization in set optimization
- Scalarization of Levitin–Polyak well-posed set optimization problems
- Levitin-Polyak well-posedness for constrained quasiconvex vector optimization problems
- Topological structure of efficient set of optimization problem of set- valued mapping
- Scalar characterizations of cone-continuous set-valued maps
Cited In (12)
- New concepts of directional derivatives for set-valued maps and applications to set optimization
- Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency
- Well-posedness and stability in set optimization with applications
- A New Topological Framework and Its Application to Well-Posedness in Set-Valued Optimization
- Levitin-Polyak well-posedness for vector optimization problems in linear spaces
- 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
- Connectedness of weak minimal solution set for set optimization problems
- Levitin-Polyak well-posedness in set optimization concerning Pareto efficiency
- On Levitin-Polyak well-posedness and stability in set optimization
- A note on ``Levitin-Polyak well-posedness in set optimization concerning Pareto efficiency
- Levitin-polyakwell-posedness for set-valued optimization problems with constraints
This page was built for publication: Characterizations of generalized Levitin-Polyak well-posed set optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1733332)