Pages that link to "Item:Q5321988"
From MaRDI portal
The following pages link to Computation of Minimum-Volume Covering Ellipsoids (Q5321988):
Displaying 50 items.
- Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem (Q254874) (← links)
- Techniques for exploring the suboptimal set (Q374684) (← links)
- On elliptical quantiles in the quantile regression setup (Q391531) (← links)
- Rank-two update algorithms for the minimum volume enclosing ellipsoid problem (Q434159) (← links)
- Solution approaches for the stochastic capacitated traveling salesmen location problem with recourse (Q493248) (← links)
- A generalization of Löwner-John's ellipsoid theorem (Q494343) (← links)
- A preliminary set of applications leading to stochastic semidefinite programs and chance-constrained semidefinite programs (Q554728) (← links)
- Stochastic second-order cone programming: applications models (Q693671) (← links)
- Estimation and asymptotics for buffered probability of exceedance (Q723976) (← links)
- Conditional minimum volume ellipsoid with application to multiclass discrimination (Q732238) (← links)
- Minimum-volume enclosing ellipsoids and core sets (Q813369) (← links)
- Stochastic semidefinite programming: a new paradigm for stochastic optimization (Q862822) (← links)
- Scale-invariant clustering with minimum volume ellipsoids (Q941528) (← links)
- Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem (Q968187) (← links)
- Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations (Q1640558) (← links)
- Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach (Q1675553) (← links)
- Early warning on stock market bubbles via methods of optimization, clustering and inverse problems (Q1703558) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- A branch-and-bound algorithm for the exact optimal experimental design problem (Q2058883) (← links)
- Computing minimum-volume enclosing ellipsoids for large datasets (Q2129596) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Robust trade-off portfolio selection (Q2218875) (← links)
- On risk-averse stochastic semidefinite programs with continuous recourse (Q2296250) (← links)
- Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem (Q2301135) (← links)
- Quantitative stability of two-stage distributionally robust risk optimization problem with full random linear semi-definite recourse (Q2304274) (← links)
- Uniform distributions and random variate generation over generalized \(l_p\) balls and spheres (Q2317290) (← links)
- Fast algorithms for the minimum volume estimator (Q2349524) (← links)
- Edge detection by spherical separation (Q2355194) (← 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)
- Local generalized quadratic distance metrics: application to the \(k\)-nearest neighbors classifier (Q2418363) (← links)
- Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities (Q2494476) (← links)
- A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids (Q2958363) (← links)
- Enhancing Pure-Pixel Identification Performance via Preconditioning (Q3192648) (← links)
- Optimal Data Fitting: A Moment Approach (Q4555461) (← links)
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications (Q4603043) (← links)
- Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization (Q4689774) (← links)
- (Q5053231) (← links)
- Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming (Q5058050) (← links)
- On directional Whitney inequality (Q5080878) (← 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)
- A STOCHASTIC APPROXIMATION ALGORITHM FOR STOCHASTIC SEMIDEFINITE PROGRAMMING (Q5358088) (← links)
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids (Q5459815) (← links)
- Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries (Q5883715) (← 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)
- Optimal portfolio and confidence set (Q6188052) (← links)
