Minimum distance to the complement of a convex set: Duality result

DOI10.1023/A:1022697822407zbMATH Open0901.90157MaRDI QIDQ1379954FDOQ1379954

Authors: Walter Briec 

Publication date: 5 March 1998

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Recommendations

• The distance between two convex sets
• scientific article; zbMATH DE number 1163269
• Theorems of the alternative and duality
• A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
• scientific article; zbMATH DE number 672178

zbMATH Keywords

duality theoremseparation theoremminimum distance to the complement of a convex set

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Programming in abstract spaces (90C48)

Cites Work

• Some NP-complete problems in quadratic and nonlinear programming
• Role of copositivity in optimality criteria for nonconvex optimization problems

Cited In (19)

• Computing the signed distance between overlapping ellipsoids
• A unified classification model based on robust optimization
• Unified approach to some geometric results in variational analysis
• Minimum \(L_1\)-distance projection onto the boundary of a convex set: simple characterization
• Can Farrell's allocative efficiency be generalized by the directional distance function approach?
• Monotonicity of minimum distance inefficiency measures for data envelopment analysis
• Technical efficiency and distance to a reverse convex set
• Using financial risk measures for analyzing generalization performance of machine learning models
• On some classes of normed and risk averse preferences
• Metric distance function and profit: Some duality results
• On how to properly calculate the Euclidean distance-based measure in DEA
• Extended robust support vector machine based on financial risk minimization
• A unified characterization of nonlinear scalarizing functionals in optimization
• Units of measurement and directional distance functions with optimal endogenous directions in data envelopment analysis
• Directional distance functions in DEA with optimal endogenous directions
• The distance between two convex sets
• Distance functions in some class of infinite dimensional vector spaces
• Decomposing economic efficiency into technical and allocative components: an essential property
• A New Class of Minimum Norm Duality Theorems

This page was built for publication: Minimum distance to the complement of a convex set: Duality result

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379954)