Pages that link to "Item:Q631700"
From MaRDI portal
The following pages link to Robust conjugate duality for convex optimization under uncertainty with application to data classification (Q631700):
Displaying 36 items.
- Some characterizations of robust optimal solutions for uncertain convex optimization problems (Q331984) (← links)
- Robust duality in parametric convex optimization (Q491220) (← 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)
- Robustness in nonsmooth nonconvex optimization problems (Q830202) (← links)
- SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization (Q1653325) (← links)
- A unifying approach to robust convex infinite optimization duality (Q1673912) (← links)
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems (Q1730467) (← links)
- Duality for robust linear infinite programming problems revisited (Q2022437) (← links)
- Robust strong duality for nonconvex optimization problem under data uncertainty in constraint (Q2142822) (← links)
- Duality for the robust sum of functions (Q2174920) (← links)
- Duality theorems for convex and quasiconvex set functions (Q2225642) (← links)
- On approximate solutions and saddle point theorems for robust convex optimization (Q2228362) (← links)
- Duality for constrained robust sum optimization problems (Q2230940) (← links)
- Strong and total Fenchel dualities for robust convex optimization problems (Q2262012) (← links)
- A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty (Q2275574) (← links)
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems (Q2322364) (← links)
- Primal-dual optimization conditions for the robust sum of functions with applications (Q2338082) (← links)
- Strong duality for robust minimax fractional programming problems (Q2355075) (← links)
- Surrogate duality for robust optimization (Q2356091) (← links)
- Convexity and closedness in stable robust duality (Q2414114) (← links)
- Robust solutions to multi-objective linear programs with uncertain data (Q2630217) (← links)
- Convex robust sum optimization problems with conic and set constraints: duality and optimality conditions revisited (Q2677665) (← links)
- Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems (Q3298015) (← links)
- (Q3384701) (← links)
- Characterizations of robust<i>ε</i>-quasi optimal solutions for nonsmooth optimization problems with uncertain data (Q4986407) (← links)
- Generalized robust duality in constrained nonconvex optimization (Q4986415) (← links)
- Moreau Envelope of Supremum Functions with Applications to Infinite and Stochastic Programming (Q5003208) (← links)
- (Q5083070) (← links)
- (Q5121102) (← links)
- A Unified Approach to Robust Farkas-Type Results with Applications to Robust Optimization Problems (Q5266535) (← links)
- Robust optimization revisited via robust vector Farkas lemmas (Q5277989) (← links)
- Support vector machine classifiers with uncertain knowledge sets via robust optimization (Q5495576) (← links)
- Sufficient Optimality Conditions for a Robust Multiobjective Problem (Q6053531) (← links)
- A characterization of the $\varepsilon$-normal set and its application in robust convex optimization problems (Q6187726) (← links)
- Sequential optimality theorems for second-order cone linear fractional vector optimization problems (Q6498081) (← links)