比尔方法的一个版本，避免了自由变量

ACM '71 Pub Date : 1900-01-01 DOI:10.1145/800184.810512

A. S. Gonçalves

{"title":"比尔方法的一个版本，避免了自由变量","authors":"A. S. Gonçalves","doi":"10.1145/800184.810512","DOIUrl":null,"url":null,"abstract":"Whithin the algorithms to solve the quadratic programming problem, Beale's method has proved to be a good one. Due to an entirely new technique to change the basis, a new version of Beale's method avoiding the use of “free-variables” is presented here. This algorithm can be seen as a condensed way to acomplish Beale's method.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A version of Beale's method avoiding the free-variables\",\"authors\":\"A. S. Gonçalves\",\"doi\":\"10.1145/800184.810512\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Whithin the algorithms to solve the quadratic programming problem, Beale's method has proved to be a good one. Due to an entirely new technique to change the basis, a new version of Beale's method avoiding the use of “free-variables” is presented here. This algorithm can be seen as a condensed way to acomplish Beale's method.\",\"PeriodicalId\":126192,\"journal\":{\"name\":\"ACM '71\",\"volume\":\"72 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM '71\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800184.810512\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM '71","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800184.810512","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

在求解二次规划问题的算法中，Beale的方法已被证明是一种很好的方法。由于采用了一种全新的技术来改变基，这里提出了一种新版本的Beale方法，避免使用“自由变量”。该算法可以看作是完成Beale方法的一种浓缩方式。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A version of Beale's method avoiding the free-variables

Whithin the algorithms to solve the quadratic programming problem, Beale's method has proved to be a good one. Due to an entirely new technique to change the basis, a new version of Beale's method avoiding the use of “free-variables” is presented here. This algorithm can be seen as a condensed way to acomplish Beale's method.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ACM '71

自引率

0.00%

发文量