Robust duality in parametric convex optimization

From MaRDI portal
Publication:491220


DOI10.1007/s11228-012-0219-yzbMath1327.90195WikidataQ59241501 ScholiaQ59241501MaRDI QIDQ491220

Radu Ioan Boţ, Guoyin Li, Vaithilingam Jeyakumar

Publication date: 24 August 2015

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11228-012-0219-y


90C25: Convex programming

90C46: Optimality conditions and duality in mathematical programming

90C31: Sensitivity, stability, parametric optimization


Related Items

Unnamed Item, Characterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain data, Generalized robust duality in constrained nonconvex optimization, Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization, A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems, Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs, Unnamed Item, Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials, Robust duality for nonconvex uncertain vector optimization via a general scalarization, Some characterizations of robust optimal solutions for uncertain convex optimization problems, On robust duality for fractional programming with uncertainty data, Robustness in nonsmooth nonconvex optimization problems, Wolfe duality and Mond-Weir duality via perturbations, Complete characterizations of robust strong duality for robust vector optimization problems, Stability of local efficiency in multiobjective optimization, A unifying approach to robust convex infinite optimization duality, Duality for robust linear infinite programming problems revisited, Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators, Robust strong duality for nonconvex optimization problem under data uncertainty in constraint, Duality for the robust sum of functions, Weighted robust optimality of convex optimization problems with data uncertainty, On approximate solutions and saddle point theorems for robust convex optimization, Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems, Primal-dual optimization conditions for the robust sum of functions with applications, Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints, Unnamed Item, Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems



Cites Work