Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
From MaRDI portal
Recommendations
Cited in
(87)- Probability bounds for polynomial functions in random variables
- Robust solutions of uncertain extended weighted Steiner problems with applications
- LMI relaxations in robust control
- Robust convex conic optimization in D-induced duality framework
- Norm induced polyhedral uncertainty sets for robust linear optimization
- Extending the Scope of Robust Quadratic Optimization
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- A robustification approach in unconstrained quadratic optimization
- On the volume of non-central sections of a cube
- Hedging against demand ambiguity in new product development: a two-stage distributionally robust approach
- Sampling methods for multi-stage robust optimization problems
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models
- Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty
- On the S-procedure and some variants
- \(\mathcal H_2\) optimal robust filtering
- Robust portfolio selection problem under temperature uncertainty
- Deriving robust counterparts of nonlinear uncertain inequalities
- Cascading: An adjusted exchange method for robust conic programming
- Selected topics in robust convex optimization
- General robust-optimization formulation for nonlinear programming
- The robust minimum cost consensus model with risk aversion
- Strong formulations of robust mixed 0-1 programming
- Improved bound for Tomaszewski's problem
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
- Semidefinite programming for chance constrained optimization over semialgebraic sets
- Robust nonlinear optimization with conic representable uncertainty set
- Some explorations on two conjectures about Rademacher sequences
- Robust optimization - a comprehensive survey
- Convex Optimization for Finite-Horizon Robust Covariance Control of Linear Stochastic Systems
- scientific article; zbMATH DE number 2102031 (Why is no real title available?)
- The cardinality of the separated vertex set of a multidimensional cube
- Maximizing perturbation radii for robust convex quadratically constrained quadratic programs
- A note on random signs
- Modelling some robust design problems via conic optimization
- Successive quadratic upper-bounding for discrete mean-risk minimization and network interdiction
- An improved probability bound for the approximate S-lemma
- Robust quadratic programming with mixed-integer uncertainty
- A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints
- Tomaszewski's problem on randomly signed sums: breaking the 3/8 barrier
- Approximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleading
- Robust optimization for non-linear impact of data variation
- Covariate-adaptive optimization in online clinical trials
- Energy maximising robust control for spectral and pseudospectral methods with application to wave energy systems
- On the ball-constrained weighted maximin dispersion problem
- Strong and total Fenchel dualities for robust convex optimization problems
- Tractable approximation to robust nonlinear production frontier problem
- A robust algorithm for quadratic optimization under quadratic constraints
- Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
- Oracle-based robust optimization via online learning
- Half-spaces with influential variable
- Arc routing under uncertainty: introduction and literature review
- Matrix sum-of-squares relaxations for robust semi-definite programs
- Strong and total Fenchel dualities for robust composed convex optimization problems in locally convex spaces
- Proof of Tomaszewski's conjecture on randomly signed sums
- Finding minimum volume circumscribing ellipsoids using generalized copositive programming
- On second-order conic programming duals for robust convex quadratic optimization problems
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem
- On robust duality for fractional programming with uncertainty data
- Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets
- Robust convex quadratically constrained programs
- Nonlinear robust optimization via sequential convex bilevel programming
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
- SDP reformulation for robust optimization problems based on nonconvex QP duality
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
- Robust convex optimization
- Primal and dual linear decision rules in stochastic and robust optimization
- Adjustable robust counterpart of conic quadratic problems
- Robust solutions of uncertain complex-valued quadratically constrained programs
- Robust network design with uncertain outsourcing cost
- Sequential efficiency optimality conditions for robust multiobjective fractional optimization problems
- Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
- Sparse and robust mean-variance portfolio optimization problems
- Trust your data or not -- StQP remains StQP: community detection via robust standard quadratic optimization
- Robust Optimization for Models with Uncertain Second-Order Cone and Semidefinite Programming Constraints
- Optimizing subscriber migrations for a telecommunication operator in uncertain context
- Robust and reliable portfolio optimization formulation of a chance constrained problem
- A robust optimization model for multi-product two-stage capacitated production planning under uncertainty
- Robust solutions to uncertain linear complementarity problems
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
- Tractable approximate robust geometric programming
- Relaxed robust second-order-cone programming
- A counter-example to a conjecture of Ben-Tal, Nemirovski and Roos
- Scenario approach for minmax optimization with emphasis on the nonconvex case: positive results and caveats
- Tractable approximations to robust conic optimization problems
- Robust convex optimization: a new perspective that unifies and extends
- Robust optimization for quadratic programs with data uncertainty using the concept of stability radius
- A new series of conjectures and open questions in optimization and matrix analysis
This page was built for publication: Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785894)
