Six heuristic algorithms for solving the K-minimum volume ellipsoid (K-MVE) problem

Q3 Physics and Astronomy Cybernetics and Physics Pub Date : 2020-12-30 DOI:10.35470/2226-4116-2020-9-4-198-205
P. Shcherbakov
{"title":"Six heuristic algorithms for solving the K-minimum volume ellipsoid (K-MVE) problem","authors":"P. Shcherbakov","doi":"10.35470/2226-4116-2020-9-4-198-205","DOIUrl":null,"url":null,"abstract":"We propose six heuristic methods for finding an approximate solution to the following combinatorial problem: GivenN points in the n-dimensional space, find the minimum-size ellipsoid covering exactly N 􀀀k of them, where k is much less than N. Various assumptions on the nature of the points and their amount are considered; the results of illustrative numerical experiments with the algorithms are discussed.","PeriodicalId":37674,"journal":{"name":"Cybernetics and Physics","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cybernetics and Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.35470/2226-4116-2020-9-4-198-205","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Physics and Astronomy","Score":null,"Total":0}
引用次数: 0

Abstract

We propose six heuristic methods for finding an approximate solution to the following combinatorial problem: GivenN points in the n-dimensional space, find the minimum-size ellipsoid covering exactly N 􀀀k of them, where k is much less than N. Various assumptions on the nature of the points and their amount are considered; the results of illustrative numerical experiments with the algorithms are discussed.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求解K-最小体积椭球(K-MVE)问题的六种启发式算法
我们提出了六种启发式方法来找到以下组合问题的近似解:在n维空间中的GivenN点,找到正好覆盖n的最小尺寸椭球􀀀其中k远小于N。考虑了关于点的性质及其数量的各种假设;文中讨论了该算法的数值实验结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Cybernetics and Physics
Cybernetics and Physics Chemical Engineering-Fluid Flow and Transfer Processes
CiteScore
1.70
自引率
0.00%
发文量
17
审稿时长
10 weeks
期刊介绍: The scope of the journal includes: -Nonlinear dynamics and control -Complexity and self-organization -Control of oscillations -Control of chaos and bifurcations -Control in thermodynamics -Control of flows and turbulence -Information Physics -Cyber-physical systems -Modeling and identification of physical systems -Quantum information and control -Analysis and control of complex networks -Synchronization of systems and networks -Control of mechanical and micromechanical systems -Dynamics and control of plasma, beams, lasers, nanostructures -Applications of cybernetic methods in chemistry, biology, other natural sciences The papers in cybernetics with physical flavor as well as the papers in physics with cybernetic flavor are welcome. Cybernetics is assumed to include, in addition to control, such areas as estimation, filtering, optimization, identification, information theory, pattern recognition and other related areas.
期刊最新文献
Enhancing functionality of two-rotor vibration machine by automatic control Adaptive exchange protocol for multi-agent communication in augmented reality system Feasibility study of permanent magnet dipoles for SILA facility Digital control of the synchronous modes of the two-rotor vibration set-up Suitability of different machine learning methods for high-speed flow modeling issues
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1