A generalization of Löwner-John's ellipsoid theorem
From MaRDI portal
Publication:494343
DOI10.1007/s10107-014-0798-5zbMath1337.90049arXiv1302.1056OpenAlexW2084193898MaRDI QIDQ494343
Publication date: 31 August 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.1056
Related Items (6)
Approximate optimal designs for multivariate polynomial regression ⋮ Convex Optimization and Parsimony of $L_p$-balls Representation ⋮ Conic version of Loewner-John ellipsoid theorem ⋮ Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension ⋮ Best approximation of functions by log-polynomials ⋮ Volume of Sublevel Sets of Homogeneous Polynomials
Uses Software
Cites Work
- Recovering an homogeneous polynomial from moments of its level set
- Computing the volume, counting integral points, and exponential sums
- Robust pole assignment via reflection coefficients of polynomials
- Ellipsoids of maximal volume in convex bodies
- A semidefinite approach for truncated \(K\)-moment problems
- Löwner-John ellipsoids
- New and old results in resultant theory
- Pattern separation by convex programming
- Robust control of polytopic systems by convex optimization
- Global Optimization with Polynomials and the Problem of Moments
- Smooth Optimization with Approximate Gradient
- GloptiPoly 3: moments, optimization and semidefinite programming
- Approximate Volume and Integration for Basic Semialgebraic Sets
- A note on the least squares fitting of ellipses
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Semidefinite Programming
- Ellipsoidal approximation of the stability domain of a polynomial
- Positive polynomials and robust stabilization with fixed-order controllers
- Computation of Minimum-Volume Covering Ellipsoids
- Inner Approximations for Polynomial Matrix Inequalities and Robust Stability Regions
- The proof of Tchakaloff’s Theorem
- The General Moment Problem, A Geometric Approach
- Convex Analysis
- What is the Laplace Transform?
- Complex analysis. Transl. from the German by Dan Fulea
- Least-squares fitting of circles and ellipses
- John's theorem for an arbitrary pair of convex bodies
- John's decomposition of the identity in the non-convex case
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A generalization of Löwner-John's ellipsoid theorem
