Pages that link to "Item:Q3083336"

The following pages link to Strong Duality in Robust Convex Programming: Complete Characterizations (Q3083336):

Displaying 49 items.

• On \(\epsilon\)-solutions for robust semi-infinite optimization problems (Q2321908) (← links)
• Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems (Q2322364) (← links)
• Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints (Q2338487) (← links)
• Strong duality for robust minimax fractional programming problems (Q2355075) (← links)
• Robust nonlinear optimization with conic representable uncertainty set (Q2355077) (← links)
• Surrogate duality for robust optimization (Q2356091) (← links)
• Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints (Q2420789) (← links)
• Robust solutions to multi-objective linear programs with uncertain data (Q2630217) (← links)
• Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules (Q2677664) (← links)
• On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty (Q2687494) (← links)
• Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems (Q2688886) (← links)
• Stable Lagrange dualities for robust conical programming (Q2786415) (← links)
• Some robust convex programs without a duality gap (Q2841072) (← links)
• Robust duality for generalized invex programming problems (Q2842362) (← links)
• (Q3384701) (← links)
• Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems (Q4609471) (← links)
• A Block Lanczos Method for the Extended Trust-Region Subproblem (Q4629333) (← links)
• Generalized robust duality in constrained nonconvex optimization (Q4986415) (← links)
• (Q5075506) (← links)
• (Q5080599) (← links)
• Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty (Q5114395) (← links)
• (Q5121102) (← links)
• Optimality conditions of robust convex multiobjective optimization via<i>ε</i>-constraint scalarization and image space analysis (Q5121765) (← links)
• Strong duality in robust semi-definite linear programming under data uncertainty (Q5169452) (← links)
• A new class of alternative theorems for SOS-convex inequalities and robust optimization (Q5175328) (← links)
• Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization (Q5213382) (← 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)
• Optimality theorems for linear fractional optimization problems involving integral functions defined on Cn [0,1] (Q5889943) (← links)
• Optimality and duality for robust multiobjective optimization problems (Q5962927) (← links)
• Sufficient Optimality Conditions for a Robust Multiobjective Problem (Q6053531) (← links)
• Strong duality in parametric robust semi-definite linear programming and exact relaxations (Q6075361) (← links)
• Robust duality for nonconvex uncertain vector optimization via a general scalarization (Q6079803) (← links)
• Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems (Q6103695) (← links)
• Robust duality for robust efficient solutions in uncertain vector optimization problems (Q6104283) (← 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)
• On approximate optimality conditions for robust multi-objective convex optimization problems (Q6169207) (← links)
• A characterization of the $\varepsilon$-normal set and its application in robust convex optimization problems (Q6187726) (← links)
• Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications (Q6197115) (← links)
• On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential (Q6204200) (← links)
• Karush-Kuhn-Tucker conditions and duality for a class of convex adjustable robust optimization problem (Q6552694) (← links)
• Local isolated efficiency in non-smooth robust semi-infinite multi-objective fractional programming problems (Q6574084) (← links)
• Optimality and duality for robust optimization problems involving intersection of closed sets (Q6608754) (← links)
• Robust nonsmooth optimality conditions for uncertain multiobjective programs involving stable functions (Q6612329) (← links)
• A support function approach for characterizations of convex normal cone (Q6621979) (← links)
• Strong and total Fenchel dualities for robust composed convex optimization problems in locally convex spaces (Q6629773) (← links)
• Theoretical aspects of robust SVM optimization in Banach spaces and Nash equilibrium interpretation (Q6630727) (← links)