The MDM algorithm and the Sylvester problem

DOI10.1134/S0965542524700684MaRDI QIDQ6634590zbMATH OpenFDO

Authors V. N. Malozemov, Nadezhda A. Solov'eva, G. Sh. Tamasyan

Publication date 8 November 2024

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0965542524700684

zbMATH Keywords

MDM algorithmquadratic programmingSylvester problem

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
• A generalized Sylvester problem and a generalized Fermat-Torricelli problem
• The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions
• An algorithm for constructing of minimal volume ellipsoid
• On the MDM method for solving the general quadratic problem of mathematical diagnostics

Cites work

• scientific article; zbMATH DE number 3366028 (Why is no real title available?)
• Integer methods of quadratic optimization
• Two Algorithms for the Minimum Enclosing Ball Problem

Cited in

(1)

• On the MDM method for solving the general quadratic problem of mathematical diagnostics

This page was built for publication: The MDM algorithm and the Sylvester problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6634590)