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 Approximation Algorithm for Multi-Objective Optimization Problems Using a Box-Coverage
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
The paper proves an extended convergence rate for inner-product norms and a dispersion theorem for cut-normals under strict convexity, then validates an adaptive metric approach numerically on three test problems.
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.
-
Adaptive Metrics for Norm-Minimization-Based Outer Approximation in Convex Vector Optimization
The paper proves an extended convergence rate for inner-product norms and a dispersion theorem for cut-normals under strict convexity, then validates an adaptive metric approach numerically on three test problems.