Pages that link to "Item:Q4895560"
From MaRDI portal
The following pages link to Rounding of Polytopes in the Real Number Model of Computation (Q4895560):
Displayed 39 items.
- Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem (Q254874) (← links)
- Rank-two update algorithms for the minimum volume enclosing ellipsoid problem (Q434159) (← links)
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
- Fast subspace approximation via greedy least-squares (Q745854) (← links)
- Minimum-volume enclosing ellipsoids and core sets (Q813369) (← links)
- An interval estimator for the unmixing of mixtures with set-based source descriptions (Q892187) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem (Q968187) (← links)
- Projective re-normalization for improving the behavior of a homogeneous conic linear system (Q1016122) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- John ellipsoid and the center of mass of a convex body (Q1991398) (← links)
- Convex programming based spectral clustering (Q2051294) (← links)
- A Newton Frank-Wolfe method for constrained self-concordant minimization (Q2141726) (← links)
- Fast algorithms for the minimum volume estimator (Q2349524) (← links)
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536) (← links)
- Clustering via minimum volume ellipsoids (Q2385541) (← links)
- A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria (Q2439646) (← links)
- Computing minimum-volume enclosing axis-aligned ellipsoids (Q2481119) (← links)
- The Geometry of Differential Privacy: The Small Database and Approximate Cases (Q2805515) (← links)
- A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids (Q2958363) (← links)
- Enhancing Pure-Pixel Identification Performance via Preconditioning (Q3192648) (← links)
- Approximation Algorithms for <i>D</i>-optimal Design (Q3387934) (← links)
- Detecting redundancy in optimization problems over intersection of ellipsoids (Q4465477) (← links)
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications (Q4603043) (← links)
- Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming (Q5058050) (← links)
- Small-scale reconstruction in three-dimensional Kolmogorov flows using four-dimensional variational data assimilation (Q5207673) (← links)
- Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization (Q5252582) (← links)
- Preconditioned Multishift BiCG for $\mathcal{H}_2$-Optimal Model Reduction (Q5270412) (← links)
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids (Q5459815) (← links)
- Rounding of convex sets and efficient gradient methods for linear programming problems (Q5459820) (← links)
- New analysis and results for the Frank-Wolfe method (Q5962717) (← links)
- A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach (Q5963815) (← links)
- Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier (Q6038640) (← links)
- Computing minimum-volume enclosing ellipsoids (Q6062882) (← links)
- A hybrid robust-stochastic optimization approach for day-ahead scheduling of cascaded hydroelectric system in restructured electricity market (Q6106511) (← links)
- Sliding window algorithm for parametric identification of dynamical systems with rectangular and ellipsoid parameter uncertainty domains (Q6138457) (← links)
- Convergence rate analysis of the multiplicative gradient method for PET-type problems (Q6161276) (← links)
- Optimal portfolio and confidence set (Q6188052) (← links)