{"title":"求解分子距离几何问题的准牛顿优化算法","authors":"Mário Salvatierra","doi":"10.1109/CLEI.2013.6670603","DOIUrl":null,"url":null,"abstract":"In this work we consider a Quasi-Newton optimization algorithm for solving the Molecular Distance Geometry Problem (MDGP). We will deal with the problem through its continuous nature.","PeriodicalId":184399,"journal":{"name":"2013 XXXIX Latin American Computing Conference (CLEI)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Quasi-Newton optimization algorithm to solve Molecular Distance Geometry Problems\",\"authors\":\"Mário Salvatierra\",\"doi\":\"10.1109/CLEI.2013.6670603\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we consider a Quasi-Newton optimization algorithm for solving the Molecular Distance Geometry Problem (MDGP). We will deal with the problem through its continuous nature.\",\"PeriodicalId\":184399,\"journal\":{\"name\":\"2013 XXXIX Latin American Computing Conference (CLEI)\",\"volume\":\"100 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 XXXIX Latin American Computing Conference (CLEI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CLEI.2013.6670603\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 XXXIX Latin American Computing Conference (CLEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CLEI.2013.6670603","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Quasi-Newton optimization algorithm to solve Molecular Distance Geometry Problems
In this work we consider a Quasi-Newton optimization algorithm for solving the Molecular Distance Geometry Problem (MDGP). We will deal with the problem through its continuous nature.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
