Some properties of nonconvex oriented distance function and applications to vector optimization problems
From MaRDI portal
Publication:2031347
DOI10.3934/jimo.2020117zbMath1474.90422OpenAlexW3040051637MaRDI QIDQ2031347
Publication date: 9 June 2021
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2020117
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weak \(E\)-optimal solution in vector optimization
- Pointwise well-posedness in set optimization with cone proper sets
- Four types of nonlinear scalarizations and some applications in set optimization
- Stability and scalarization in vector optimization using improvement sets
- Optimality conditions for approximate solutions of vector optimization problems
- Nonconvex separation theorems and some applications in vector optimization
- Well-posedness and scalarization in vector optimization
- Lagrangian conditions for vector optimization in Banach spaces
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- Merit functions in vector optimization
- On the Clarke subdifferential of the distance function of a closed set
- Shape analysis via oriented distance functions
- Relationships between the oriented distance functional and a nonlinear separation functional
- Characterizations for optimality conditions of general robust optimization problems
- Variational analysis on the signed distance functions
- Scalarization in set optimization with solid and nonsolid ordering cones
- Improvement sets and vector optimization
- Characterization of set relations through extensions of the oriented distance
- Sublevel representations of epi-Lipschitz sets and other properties
- Characterizations of multiobjective robustness via oriented distance function and image space analysis
- Properties of the nonlinear scalar functional and its applications to vector optimization problems
- Scalarization in geometric and functional vector optimization revisited
- A general approach for studying duality in multiobjective optimization
- Vector optimization. Set-valued and variational analysis.
- Nonlinear Scalarizations of Set Optimization Problems with Set Orderings
- Functional Analysis, Calculus of Variations and Optimal Control
- Generalized Directional Derivatives and Subgradients of Nonconvex Functions
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- A chain rule for nonsmooth composite functions via minimisation
- Degrees of Efficiency and Degrees of Minimality
- A set scalarization function based on the oriented distance and relations with other set scalarizations
- E-Benson proper efficiency in vector optimization
- Set-valued Optimization
- Nonconvex Separation Functional in Linear Spaces with Applications to Vector Equilibria
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
