Minimum distance to the complement of a convex set: Duality result
From MaRDI portal
Publication:1379954
DOI10.1023/A:1022697822407zbMath0901.90157MaRDI QIDQ1379954
Publication date: 5 March 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items (16)
Unified approach to some geometric results in variational analysis ⋮ Computing the Signed Distance Between Overlapping Ellipsoids ⋮ A Unified Classification Model Based on Robust Optimization ⋮ Using financial risk measures for analyzing generalization performance of machine learning models ⋮ On some classes of normed and risk averse preferences ⋮ Decomposing economic efficiency into technical and allocative components: an essential property ⋮ Extended Robust Support Vector Machine Based on Financial Risk Minimization ⋮ Can Farrell's allocative efficiency be generalized by the directional distance function approach? ⋮ Monotonicity of minimum distance inefficiency measures for data envelopment analysis ⋮ On how to properly calculate the Euclidean distance-based measure in DEA ⋮ The distance between two convex sets ⋮ Units of measurement and directional distance functions with optimal endogenous directions in data envelopment analysis ⋮ Minimum \(L_1\)-distance projection onto the boundary of a convex set: simple characterization ⋮ Directional Distance Functions in DEA with Optimal Endogenous Directions ⋮ Metric distance function and profit: Some duality results ⋮ A unified characterization of nonlinear scalarizing functionals in optimization
Cites Work
This page was built for publication: Minimum distance to the complement of a convex set: Duality result
