Pages that link to "Item:Q1315411"
From MaRDI portal
The following pages link to On the complexity of approximating the maximal inscribed ellipsoid for a polytope (Q1315411):
Displaying 36 items.
- Most likely maximum entropy for population analysis with region-censored data (Q296389) (← links)
- Rank-two update algorithms for the minimum volume enclosing ellipsoid problem (Q434159) (← links)
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
- A portfolio selection model using fuzzy returns (Q540671) (← links)
- Conditional minimum volume ellipsoid with application to multiclass discrimination (Q732238) (← links)
- Minimum-volume enclosing ellipsoids and core sets (Q813369) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method (Q1293951) (← links)
- Methods of centers for variational inequalities and linear programming (Q1294369) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Interior-point methods: An old and new approach to nonlinear programming (Q1365059) (← links)
- Recursive algorithms for inner ellipsoidal approximation of convex polytopes. (Q1413940) (← links)
- Oracle-polynomial-time approximation of largest simplices in convex bodies (Q1574577) (← links)
- A modification of the inscribed ellipsoid method (Q1900254) (← links)
- Algorithms to construct a minimum-volume invariant ellipsoid for a stable dynamic system (Q1918744) (← links)
- A cutting plane algorithm for convex programming that uses analytic centers (Q1922689) (← links)
- Approximating fixed points of weakly contracting mappings (Q1974567) (← links)
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536) (← links)
- Clustering via minimum volume ellipsoids (Q2385541) (← links)
- On the minimum volume simplex enclosure problem for estimating a linear mixing model (Q2392121) (← links)
- How to solve a design centering problem (Q2408900) (← links)
- A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria (Q2439646) (← links)
- Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities (Q2494476) (← links)
- Playing Billiards in Version Space (Q3123289) (← links)
- SHARPENING GEOMETRIC INEQUALITIES USING COMPUTABLE SYMMETRY MEASURES (Q3195358) (← links)
- On self-concordant convex–concave functions (Q4504785) (← links)
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications (Q4603043) (← links)
- Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming (Q5058050) (← links)
- Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies (Q5200559) (← links)
- Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization (Q5252582) (← links)
- An interior-point smoothing technique for Lagrangian relaxation in large-scale convex programming† (Q5449022) (← links)
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids (Q5459815) (← links)
- Inscribed ball and enclosing box methods for the convex maximization problem (Q5963240) (← links)
- Accuracy certificates for convex minimization with inexact oracle (Q6661688) (← links)
