Pauliina Paasivirta, Riikka Numminen, Antti Airola, Napsu Karmitsa, Tapio Pahikkala
{"title":"用 ℓ0 惩罚最小二乘法预测配对相互作用亲和力--基于非平滑双目标优化的方法*","authors":"Pauliina Paasivirta, Riikka Numminen, Antti Airola, Napsu Karmitsa, Tapio Pahikkala","doi":"10.1080/10556788.2023.2280784","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce a novel nonsmooth optimization-based method LMBM-Kronℓ0LS for solving large-scale pairwise interaction affinity prediction problems. The aim of LMBM-Kronℓ0LS is to produ...","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":"14 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Predicting pairwise interaction affinities with ℓ0-penalized least squares–a nonsmooth bi-objective optimization based approach*\",\"authors\":\"Pauliina Paasivirta, Riikka Numminen, Antti Airola, Napsu Karmitsa, Tapio Pahikkala\",\"doi\":\"10.1080/10556788.2023.2280784\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we introduce a novel nonsmooth optimization-based method LMBM-Kronℓ0LS for solving large-scale pairwise interaction affinity prediction problems. The aim of LMBM-Kronℓ0LS is to produ...\",\"PeriodicalId\":54673,\"journal\":{\"name\":\"Optimization Methods & Software\",\"volume\":\"14 1\",\"pages\":\"\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-01-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Optimization Methods & Software\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1080/10556788.2023.2280784\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optimization Methods & Software","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1080/10556788.2023.2280784","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
Predicting pairwise interaction affinities with ℓ0-penalized least squares–a nonsmooth bi-objective optimization based approach*
In this paper, we introduce a novel nonsmooth optimization-based method LMBM-Kronℓ0LS for solving large-scale pairwise interaction affinity prediction problems. The aim of LMBM-Kronℓ0LS is to produ...
期刊介绍:
Optimization Methods and Software
publishes refereed papers on the latest developments in the theory and realization of optimization methods, with particular emphasis on the interface between software development and algorithm design.
Topics include:
Theory, implementation and performance evaluation of algorithms and computer codes for linear, nonlinear, discrete, stochastic optimization and optimal control. This includes in particular conic, semi-definite, mixed integer, network, non-smooth, multi-objective and global optimization by deterministic or nondeterministic algorithms.
Algorithms and software for complementarity, variational inequalities and equilibrium problems, and also for solving inverse problems, systems of nonlinear equations and the numerical study of parameter dependent operators.
Various aspects of efficient and user-friendly implementations: e.g. automatic differentiation, massively parallel optimization, distributed computing, on-line algorithms, error sensitivity and validity analysis, problem scaling, stopping criteria and symbolic numeric interfaces.
Theoretical studies with clear potential for applications and successful applications of specially adapted optimization methods and software to fields like engineering, machine learning, data mining, economics, finance, biology, or medicine. These submissions should not consist solely of the straightforward use of standard optimization techniques.