Pages that link to "Item:Q5131707"
From MaRDI portal
The following pages link to Computing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection (Q5131707):
Displaying 7 items.
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope (Q1315411) (← links)
- Maximizing perturbation radii for robust convex quadratically constrained quadratic programs (Q2030501) (← links)
- Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization (Q4689774) (← links)
- Probabilistic Guarantees in Robust Optimization (Q5013583) (← links)
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
- Robust Optimization for Models with Uncertain Second-Order Cone and Semidefinite Programming Constraints (Q5084645) (← links)
- Pareto adaptive robust optimality via a Fourier-Motzkin elimination lens (Q6126657) (← links)