Pages that link to "Item:Q3083336"
From MaRDI portal
The following pages link to Strong Duality in Robust Convex Programming: Complete Characterizations (Q3083336):
Displaying 50 items.
- On \(\epsilon\)-solutions for robust fractional optimization problems (Q261808) (← links)
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data (Q270047) (← links)
- Robust canonical duality theory for solving nonconvex programming problems under data uncertainty (Q328533) (← links)
- Some characterizations of robust optimal solutions for uncertain convex optimization problems (Q331984) (← links)
- Robust linear semi-infinite programming duality under uncertainty (Q353146) (← links)
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty (Q432370) (← links)
- Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
- Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995) (← links)
- Robust duality in parametric convex optimization (Q491220) (← links)
- Duality and robust duality for special nonconvex homogeneous quadratic programming under certainty and uncertainty environment (Q496622) (← links)
- Robust conjugate duality for convex optimization under uncertainty with application to data classification (Q631700) (← links)
- Robust duality for generalized convex programming problems under data uncertainty (Q654075) (← links)
- Robust duality for fractional programming problems with constraint-wise data uncertainty (Q658562) (← links)
- On robust duality for fractional programming with uncertainty data (Q743463) (← links)
- Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality (Q778163) (← links)
- Robustness in nonsmooth nonconvex optimization problems (Q830202) (← links)
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications (Q974991) (← links)
- Complete characterizations of robust strong duality for robust vector optimization problems (Q1639956) (← links)
- SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization (Q1653325) (← links)
- Characterizations for optimality conditions of general robust optimization problems (Q1670134) (← links)
- Characterizations of robust solution set of convex programs with uncertain data (Q1670545) (← links)
- A unifying approach to robust convex infinite optimization duality (Q1673912) (← links)
- On quasi \(\epsilon\)-solution for robust convex optimization problems (Q1686550) (← links)
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs (Q1706408) (← links)
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems (Q1730467) (← links)
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints (Q1785470) (← links)
- Duality for robust linear infinite programming problems revisited (Q2022437) (← links)
- Adjustable robust balanced hub location problem with uncertain transportation cost (Q2027703) (← links)
- Exact dual bounds for some nonconvex minimax quadratic optimization problems (Q2043977) (← links)
- Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity (Q2052413) (← links)
- Karush-Kuhn-Tucker optimality conditions for a class of robust optimization problems with an interval-valued objective function (Q2053413) (← links)
- Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators (Q2074630) (← links)
- Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty (Q2108799) (← links)
- An efficient algorithm for the extended trust-region subproblem with two linear constraints (Q2119320) (← links)
- Optimality conditions for robust nonsmooth multiobjective optimization problems in asplund spaces (Q2139119) (← links)
- Robust strong duality for nonconvex optimization problem under data uncertainty in constraint (Q2142822) (← links)
- On approximate efficiency for nonsmooth robust vector optimization problems (Q2153390) (← links)
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications (Q2156392) (← links)
- Optimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problems (Q2156706) (← links)
- Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty (Q2188944) (← links)
- Weighted robust optimality of convex optimization problems with data uncertainty (Q2191283) (← links)
- Duality theorems for convex and quasiconvex set functions (Q2225642) (← links)
- On approximate solutions and saddle point theorems for robust convex optimization (Q2228362) (← links)
- On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations (Q2257075) (← links)
- Characterizing robust solution sets of convex programs under data uncertainty (Q2260682) (← links)
- Strong and total Fenchel dualities for robust convex optimization problems (Q2262012) (← links)
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality (Q2273897) (← links)
- A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty (Q2275574) (← links)
- A unified approach through image space analysis to robustness in uncertain optimization problems (Q2302752) (← links)
