Finding minimum volume circumscribing ellipsoids using generalized copositive programming
From MaRDI portal
Recommendations
- Algorithms to construct a minimum-volume invariant ellipsoid for a stable dynamic system
- Duality of ellipsoidal approximations via semi-infinite programming
- A generalization of Löwner-John's ellipsoid theorem
- Improved Complexity for Maximum Volume Inscribed Ellipsoids
- Computation of Minimum-Volume Covering Ellipsoids
Cites work
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
- Adjustable robust solutions of uncertain linear programs
- Computation of Minimum-Volume Covering Ellipsoids
- Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls
- Constructing Risk Measures from Uncertainty Sets
- Containment problems for polytopes and spectrahedra
- Copositive optimization -- recent developments and applications
- Copositive programming
- Distributionally robust multi-item newsvendor problems with multimodal demand distributions
- Ellipsoidal bounds for uncertain linear equations and dynamical systems
- Ellipsoidal calculus for estimation and control
- Fast algorithms for the minimum volume estimator
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Improved Conic Reformulations for $K$-means Clustering
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linear Matrix Inequalities in System and Control Theory
- LMI Approximations for Cones of Positive Semidefinite Forms
- Löwner-John ellipsoids
- Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities
- Minimax analysis of stochastic problems
- Minimum Covering Ellipses
- Minimum-volume ellipsoids. Theory and algorithms
- Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
- Models for minimax stochastic linear optimization problems with risk aversion
- Multistage robust mixed-integer optimization with adaptive partitions
- Obstacle collision detection using best ellipsoid fit
- On Cones of Nonnegative Quadratic Functions
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- On the complexity of four polyhedral set containment problems
- On the Minimum Volume Covering Ellipsoid of Ellipsoids
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Robust quadratic programming with mixed-integer uncertainty
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Rounding of Polytopes in the Real Number Model of Computation
- Second-order-cone constraints for extended trust-region subproblems
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- The matricial relaxation of a linear matrix inequality
- The minimum sphere covering a convex polyhedron
- Worst-case conditional value-at-risk with application to robust portfolio management
Cited in
(5)- Exact optimization: Part I
- Duality of ellipsoidal approximations via semi-infinite programming
- Computing minimum-volume enclosing ellipsoids
- Optimization under uncertainty and risk: quadratic and copositive approaches
- On gain scheduling trajectory stabilization for nonlinear systems: theoretical insights and experimental results
This page was built for publication: Finding minimum volume circumscribing ellipsoids using generalized copositive programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058050)
