Robust convex quadratically constrained programs
From MaRDI portal
Publication:1403300
DOI10.1007/s10107-003-0425-3zbMath1106.90365OpenAlexW2146444777MaRDI QIDQ1403300
Publication date: 1 September 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0425-3
Related Items
A survey of nonlinear robust optimization, Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data, Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems, Tractable approximate robust geometric programming, Robust CCMV model with short selling and risk-neutral interest rate, Methods for minimax estimation under elementwise covariance uncertainty, Conic linear programming duals for classes of quadratic semi-infinite programs with applications, SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization, Extending the Scope of Robust Quadratic Optimization, On approximate solutions for robust convex semidefinite optimization problems, Robust and distributionally robust optimization models for linear support vector machine, Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems, Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones, Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems, On second-order conic programming duals for robust convex quadratic optimization problems, Characterizing a class of robust vector polynomial optimization via sum of squares conditions, Worst-case violation of sampled convex programs for optimization with uncertainty, Robust solutions to uncertain linear complementarity problems, Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs, Portfolio optimization model with and without options under additional constraints, On approximatingD-induced polar sets of geometric and extended geometric cones, On approximating D-induced polar sets of a second-order cone by an ellipsoid, A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems, Methods of searching for guaranteeing and optimistic solutions to integer optimization problems under uncertainty, On two-stage convex chance constrained problems, Multi-class second-order cone programming support vector machines, Recent developments in robust portfolios with a worst-case approach, Strong duality in robust semi-definite linear programming under data uncertainty, Robust SOS-convex polynomial optimization problems: exact SDP relaxations, Characterizing robust solution sets of convex programs under data uncertainty, A relaxation algorithm with a probabilistic guarantee for robust deviation optimization, Unnamed Item, Second-Order Cone Programming Formulations for Robust Multiclass Classification, Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints, Robust portfolios: contributions from operations research and finance, Maximizing perturbation radii for robust convex quadratically constrained quadratic programs, Selected topics in robust convex optimization, General robust-optimization formulation for nonlinear programming, Derivative-free robust optimization by outer approximations, Block Coordinate Descent Methods for Semidefinite Programming, Robust Quadratic Programming with Mixed-Integer Uncertainty, Relaxed robust second-order-cone programming, A robust approach based on conditional value-at-risk measure to statistical learning problems, Portfolio selection under distributional uncertainty: a relative robust CVaR approach, On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization, Robust nonlinear optimization with conic representable uncertainty set
