Robust convex quadratically constrained programs
From MaRDI portal
Recommendations
Cited in
(59)- Characterizing robust solution sets of convex programs under data uncertainty
- Radius of robust feasibility for adjustable robust linear inequality systems with affine decision rules
- Optimality conditions and semidefinite linear programming duals for two-stage adjustable robust quadratic optimization
- Extending the Scope of Robust Quadratic Optimization
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- Portfolio optimization model with and without options under additional constraints
- Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems
- A robustification approach in unconstrained quadratic optimization
- Extended twin parametric margin support vector regression
- Distributionally robust chance-constrained kernel-based support vector machine
- Methods of searching for guaranteeing and optimistic solutions to integer optimization problems under uncertainty
- A relaxation algorithm with a probabilistic guarantee for robust deviation optimization
- Cascading: An adjusted exchange method for robust conic programming
- Selected topics in robust convex optimization
- A distributionally robust chance-constrained kernel-free quadratic surface support vector machine
- SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization
- General robust-optimization formulation for nonlinear programming
- A robust time‐inconsistent linear‐quadratic problem
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition
- On approximate solutions for robust convex semidefinite optimization problems
- Robust nonlinear optimization with conic representable uncertainty set
- On approximating D-induced polar sets of a second-order cone by an ellipsoid
- Strong duality in robust semi-definite linear programming under data uncertainty
- Maximizing perturbation radii for robust convex quadratically constrained quadratic programs
- Derivative-free robust optimization by outer approximations
- Portfolio selection under distributional uncertainty: a relative robust CVaR approach
- Methods for minimax estimation under elementwise covariance uncertainty
- Robust quadratic programming with mixed-integer uncertainty
- Robust portfolios: contributions from operations research and finance
- Characterizing a class of robust vector polynomial optimization via sum of squares conditions
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications
- On two-stage convex chance constrained problems
- On approximatingD-induced polar sets of geometric and extended geometric cones
- Robust CCMV model with short selling and risk-neutral interest rate
- A robust algorithm for quadratic optimization under quadratic constraints
- A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
- On second-order conic programming duals for robust convex quadratic optimization problems
- SDP reformulation for robust optimization problems based on nonconvex QP duality
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- Robust solutions of uncertain complex-valued quadratically constrained programs
- Exact SDP reformulations for adjustable robust quadratic optimization with affine decision rules
- Second-Order Cone Programming Formulations for Robust Multiclass Classification
- Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems
- Robust solutions to uncertain linear complementarity problems
- Recent developments in robust portfolios with a worst-case approach
- A robust approach based on conditional value-at-risk measure to statistical learning problems
- Tractable approximate robust geometric programming
- Worst-case violation of sampled convex programs for optimization with uncertainty
- Relaxed robust second-order-cone programming
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems
- Multi-class second-order cone programming support vector machines
- On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization
- A survey of nonlinear robust optimization
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
- Block coordinate descent methods for semidefinite programming
- Robust and distributionally robust optimization models for linear support vector machine
This page was built for publication: Robust convex quadratically constrained programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1403300)
