Largest dual ellipsoids inscribed in dual cones
From MaRDI portal
Publication:959981
DOI10.1007/s10107-007-0171-zzbMath1165.90025OpenAlexW2082627002MaRDI QIDQ959981
Publication date: 16 December 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/9301
Related Items
Todd's maximum-volume ellipsoid problem on symmetric cones, Linear optimization over homogeneous matrix cones
Cites Work
- Unnamed Item
- Unnamed Item
- Applications of second-order cone programming
- Some perturbation theory for linear programming
- Scaling, shifting and weighting in interior-point methods
- Second-order cone programming
- Complexity of convex optimization using geometry-based measures and a reference point
- Bounds for error in the solution set of a perturbed linear program
- Linear programming, complexity theory and elementary functional analysis
- Function spaces and reproducing kernels on bounded symmetric domains
- Lectures on Modern Convex Optimization
- Semidefinite optimization
- Normal Maps Induced by Linear Transformations
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Hyperbolic Polynomials and Interior Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization
- Semidefinite Programming
