Pages that link to "Item:Q2786415"
From MaRDI portal
The following pages link to Stable Lagrange dualities for robust conical programming (Q2786415):
Displaying 15 items.
- On constraint qualifications of a nonconvex inequality (Q723504) (← links)
- Cascading: An adjusted exchange method for robust conic programming (Q940832) (← links)
- A unifying approach to robust convex infinite optimization duality (Q1673912) (← links)
- Stable zero Lagrange duality for DC conic programming (Q1952895) (← links)
- Duality for robust linear infinite programming problems revisited (Q2022437) (← links)
- Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty (Q2188944) (← links)
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems (Q2322364) (← links)
- Some characterizations of approximate solutions for robust semi-infinite optimization problems (Q2664903) (← links)
- Characterizations of robust<i>ε</i>-quasi optimal solutions for nonsmooth optimization problems with uncertain data (Q4986407) (← links)
- On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty (Q5069193) (← links)
- A note on the radius of robust feasibility for uncertain convex programs (Q5086884) (← links)
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty (Q5121777) (← links)
- Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization (Q5213382) (← links)
- On second-order conic programming duals for robust convex quadratic optimization problems (Q6160375) (← links)
- Characterizing a class of robust vector polynomial optimization via sum of squares conditions (Q6161553) (← links)
