Improved Complexity for Maximum Volume Inscribed Ellipsoids

SIAM Journal on Optimization - United States
doi 10.1137/s1052623401390902
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Largest Dual Ellipsoids Inscribed in Dual Cones

Mathematical Programming, Series B
MathematicsSoftware
2007English

Learning Maximum Excluding Ellipsoids From Imbalanced Data With Theoretical Guarantees

Pattern Recognition Letters
Signal ProcessingComputer VisionPattern RecognitionArtificial IntelligenceSoftware
2018English

Minimum Ellipsoids

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1964English

Linear Convergence of a Modified Frank–Wolfe Algorithm for Computing Minimum-Volume Enclosing Ellipsoids

Optimization Methods and Software
ControlApplied MathematicsOptimizationSoftware
2008English

Improved Algorithm for Mining Maximum Frequent Patterns Based on FP-Tree

2012English

An Improved Bit Parallel Exact Maximum Clique Algorithm

Optimization Letters
ControlOptimization
2011English

New Improved Maximum Power Point Tracking Algorithm for Partially Shaded PV Systems

Journal of Power and Energy Engineering
2017English

Improved Bounds on Maximum Size Binary Radar Arrays

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1997English

Minimum-Volume Covering Ellipsoids: Improving the Efficiency of the Wolfe-Atwood Algorithm for Large-Scale Instances by Pooling and Batching

Mendel
ControlSystems EngineeringDecision SciencesComputer ScienceComputational MathematicsArtificial IntelligenceTheoretical Computer Science
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy