Variational Methods in Partially Ordered Spaces
From MaRDI portal
Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48)
Recommendations
Cited in
(15)- Variational methods in partially ordered spaces
- scientific article; zbMATH DE number 5602590 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- Nonlinear strict cone separation theorems in real normed spaces
- Efficient solutions in uncertain multiobjective optimization with countably many scenarios
- Point-based sufficient conditions for sharp solutions in nonsmooth optimization
- Necessary conditions for approximate solutions of vector and set optimization problems with variable domination structure
- Ekeland's variational principle in premetric spaces
- Two-variable domination structures and applications in vector optimization
- Symmetric and non-symmetric cone separation via Bishop-Phelps cones in normed spaces
- Scalarization and well-posedness for set optimization problems involving general set less relations
- Cone-compactness of a set and related topological properties: stability issues and applications
- External and internal stability for set optimization problems
- Revisiting approximate minimality and approximate criticality in scalar optimization with constraints
- Bishop-Phelps type scalarization for vector optimization in real topological-linear spaces
This page was built for publication: Variational Methods in Partially Ordered Spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6069193)