Extending the Scope of Robust Quadratic Optimization
From MaRDI portal
Publication:5084646
Recommendations
- A robustification approach in unconstrained quadratic optimization
- A robust algorithm for quadratic optimization under quadratic constraints
- Robust convex quadratically constrained programs
- Robust quadratic optimization of systems with large parameter variations
- Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Some extensions of robust linear optimization
- Robust quadratic programming with mixed-integer uncertainty
- Robust and structure exploiting optimisation algorithms: an integral quadratic constraint approach
- Adjustable robust counterpart of conic quadratic problems
Cites work
- Accuracy and Stability of Numerical Algorithms
- Adjustable robust solutions of uncertain linear programs
- Asymptotic Statistics
- Data-driven robust optimization
- Deriving robust counterparts of nonlinear uncertain inequalities
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Financial econometrics. Models and methods
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Quadratic programming with one negative eigenvalue is NP-hard
- Robust convex optimization
- Robust convex quadratically constrained programs
- Robust linear optimization under general norms.
- Robust optimization
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robust Solutions to Uncertain Semidefinite Programs
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Testing for (in)finite moments
- The Price of Robustness
Cited in
(4)
This page was built for publication: Extending the Scope of Robust Quadratic Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084646)