Robust Duality in Parametric Convex Optimization |
| |
Authors: | R I Bo? V Jeyakumar G Y Li |
| |
Institution: | 1. Department of Mathematics, Chemnitz University of Technology, 09107, Chemnitz, Germany 2. Department of Applied Mathematics, University of New South Wales, Sydney, 2052, Australia
|
| |
Abstract: | Modelling of convex optimization in the face of data uncertainty often gives rise to families of parametric convex optimization problems. This motivates us to present, in this paper, a duality framework for a family of parametric convex optimization problems. By employing conjugate analysis, we present robust duality for the family of parametric problems by establishing strong duality between associated dual pair. We first show that robust duality holds whenever a constraint qualification holds. We then show that this constraint qualification is also necessary for robust duality in the sense that the constraint qualification holds if and only if robust duality holds for every linear perturbation of the objective function. As an application, we obtain a robust duality theorem for the best approximation problems with constraint data uncertainty under a strict feasibility condition. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|