Pages that link to "Item:Q3632942"

The following pages link to Cutting-set methods for robust convex optimization with pessimizing oracles (Q3632942):

Displaying 32 items.

• An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
• Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
• Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations (Q724114) (← links)
• Dominance for multi-objective robust optimization concepts (Q1622793) (← links)
• An algorithm based on semidefinite programming for finding minimax optimal designs (Q1662093) (← links)
• Data-driven robust optimization (Q1702776) (← links)
• ROmodel: modeling robust optimization problems in pyomo (Q2101652) (← links)
• \(K\)-adaptability in two-stage mixed-integer robust optimization (Q2195680) (← links)
• Robust trade-off portfolio selection (Q2218875) (← links)
• A steepest descent method for set optimization problems with set-valued mappings of finite cardinality (Q2231334) (← links)
• Recent advances in robust optimization: an overview (Q2256312) (← links)
• On polyhedral and second-order cone decompositions of semidefinite optimization problems (Q2294533) (← links)
• Approximate cutting plane approaches for exact solutions to robust optimization problems (Q2301927) (← links)
• Exploiting problem structure in optimization under uncertainty via online convex optimization (Q2316616) (← links)
• Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem (Q2329707) (← links)
• Variations and extension of the convex-concave procedure (Q2358020) (← links)
• Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models (Q2424760) (← links)
• Adversarial classification via distributional robustness with Wasserstein ambiguity (Q2693647) (← links)
• Robust reliable control design for networked control system with sampling communication (Q2799291) (← links)
• Wald's mighty maximin: a tutorial (Q2816366) (← links)
• Duality in Two-Stage Adaptive Linear Optimization: Faster Computation and Stronger Bounds (Q2830953) (← links)
• Oracle-Based Robust Optimization via Online Learning (Q3450465) (← links)
• (Q4614094) (← links)
• Optimal Rates for Multi-pass Stochastic Gradient Methods (Q4637012) (← links)
• Adjustable Robust Optimization via Fourier–Motzkin Elimination (Q4971396) (← links)
• Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets (Q5084616) (← links)
• Online First-Order Framework for Robust Convex Optimization (Q5131545) (← links)
• Reducing Conservatism in Robust Optimization (Q5148195) (← links)
• Approximate dynamic programming via iterated Bellman inequalities (Q5256802) (← links)
• Recent advances in nonconvex semi-infinite programming: applications and algorithms (Q6114904) (← links)
• An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (Q6166102) (← links)
• An oracle-based framework for robust combinatorial optimization (Q6183084) (← links)