Proves that ℓ_p norm minimization yields p-independent Hausdorff convergence rate O(k^{2/(1-q)}) in convex vector optimization via Euclidean intermediary and norm equivalence.
An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2years
2026 2representative citing papers
citing papers explorer
-
Convergence Rates for $\ell_p$ Norm Minimization in Convex Vector Optimization
Proves that ℓ_p norm minimization yields p-independent Hausdorff convergence rate O(k^{2/(1-q)}) in convex vector optimization via Euclidean intermediary and norm equivalence.