Pages that link to "Item:Q1379954"
From MaRDI portal
The following pages link to Minimum distance to the complement of a convex set: Duality result (Q1379954):
Displaying 17 items.
- Using financial risk measures for analyzing generalization performance of machine learning models (Q889281) (← links)
- Metric distance function and profit: Some duality results (Q1293950) (← links)
- Can Farrell's allocative efficiency be generalized by the directional distance function approach? (Q1752810) (← links)
- Monotonicity of minimum distance inefficiency measures for data envelopment analysis (Q1753428) (← links)
- On some classes of normed and risk averse preferences (Q1934576) (← links)
- Units of measurement and directional distance functions with optimal endogenous directions in data envelopment analysis (Q2282563) (← links)
- A unified characterization of nonlinear scalarizing functionals in optimization (Q2330979) (← links)
- Unified approach to some geometric results in variational analysis (Q2372176) (← links)
- The distance between two convex sets (Q2497250) (← links)
- Decomposing economic efficiency into technical and allocative components: an essential property (Q2696998) (← links)
- Computing the Signed Distance Between Overlapping Ellipsoids (Q3454510) (← links)
- Directional Distance Functions in DEA with Optimal Endogenous Directions (Q4971395) (← links)
- A Unified Classification Model Based on Robust Optimization (Q5327189) (← links)
- Extended Robust Support Vector Machine Based on Financial Risk Minimization (Q5383801) (← links)
- On how to properly calculate the Euclidean distance-based measure in DEA (Q5413894) (← links)
- Minimum \(L_1\)-distance projection onto the boundary of a convex set: simple characterization (Q5959917) (← links)
- Distance functions in some class of infinite dimensional vector spaces (Q6536849) (← links)
