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.
Algorithms to Solve Unbounded Convex Vector Optimization Problems
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
Adaptive inner-product metrics in norm-minimization outer approximation retain the O(k^{2/(1-q)}) Euclidean rate and stay well-conditioned when the upper image is strictly convex with bounded curvature.
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
Adaptive inner-product metrics in norm-minimization outer approximation retain the O(k^{2/(1-q)}) Euclidean rate and stay well-conditioned when the upper image is strictly convex with bounded curvature.