{"title":"一个存储库的凸二次规划问题","authors":"I. Maros, C. Mészáros","doi":"10.1080/10556789908805768","DOIUrl":null,"url":null,"abstract":"The introduction of a standard set of linear programming problems, to be found in NETLIB/-LP/DATA, had an important impact on measuring, comparing and reporting the performance of LP solvers. Until recently the efficiency of new algorithmic developments has been measured using this important reference set. Presently, we are witnessing an ever growing interest in the area of quadratic programming. The research community is somewhat troubled by the lack of a standard format for defining a QP problem and also by the lack of a standard reference set of problems for purposes similar to that of LP. In the paper we propose a standard format and announce the availability of a test set of collected 138 QP problems.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":"106 1","pages":"671-681"},"PeriodicalIF":1.4000,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"127","resultStr":"{\"title\":\"A repository of convex quadratic programming problems\",\"authors\":\"I. Maros, C. Mészáros\",\"doi\":\"10.1080/10556789908805768\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The introduction of a standard set of linear programming problems, to be found in NETLIB/-LP/DATA, had an important impact on measuring, comparing and reporting the performance of LP solvers. Until recently the efficiency of new algorithmic developments has been measured using this important reference set. Presently, we are witnessing an ever growing interest in the area of quadratic programming. The research community is somewhat troubled by the lack of a standard format for defining a QP problem and also by the lack of a standard reference set of problems for purposes similar to that of LP. In the paper we propose a standard format and announce the availability of a test set of collected 138 QP problems.\",\"PeriodicalId\":54673,\"journal\":{\"name\":\"Optimization Methods & Software\",\"volume\":\"106 1\",\"pages\":\"671-681\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"1999-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"127\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Optimization Methods & Software\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1080/10556789908805768\",\"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/10556789908805768","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
A repository of convex quadratic programming problems
The introduction of a standard set of linear programming problems, to be found in NETLIB/-LP/DATA, had an important impact on measuring, comparing and reporting the performance of LP solvers. Until recently the efficiency of new algorithmic developments has been measured using this important reference set. Presently, we are witnessing an ever growing interest in the area of quadratic programming. The research community is somewhat troubled by the lack of a standard format for defining a QP problem and also by the lack of a standard reference set of problems for purposes similar to that of LP. In the paper we propose a standard format and announce the availability of a test set of collected 138 QP problems.
期刊介绍:
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.