{"entities":{"Q1315207":{"pageid":1325957,"ns":120,"title":"Item:Q1315207","lastrevid":70681293,"modified":"2026-04-13T16:07:56Z","type":"item","id":"Q1315207","labels":{"en":{"language":"en","value":"An algorithm for complex linear approximation based on semi-infinite programming"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 510206"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$2FA3D083-37A0-45FE-BBB2-870D73DA2BDE","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ae74436b630332657fab8c0cb7c36cde3c455503","datavalue":{"value":{"text":"An algorithm for complex linear approximation based on semi-infinite programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1315207$13DB6B94-6276-4467-8349-3F7B4AE9757B","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"2bf5356f092f528a2c333859a2eb1b6a89614d82","datavalue":{"value":"0798.65028","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1315207$4D9175A3-2ABD-4C78-935E-D600773B5290","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"94cfc6d25d39f512261c585ccbc2c371a5e3f0b5","datavalue":{"value":"10.1007/BF02108463","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1315207$A899CC85-A858-4FAC-AD82-0E9CD20279CD","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"be754c116e47f9bb21ed4b906f6adc7add613daa","datavalue":{"value":{"entity-type":"item","numeric-id":200792,"id":"Q200792"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$C2A5B5EF-D4F9-4C62-8B1C-A7296806B0F4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f1fd4966a271e898ecb70b7fdadd7915c9f14bf0","datavalue":{"value":{"entity-type":"item","numeric-id":601681,"id":"Q601681"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$3FF08F0F-5896-4BF8-895F-09B18369D21C","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"95f4a47752e6dde2f4d6f910dcba94ba8b5377c0","datavalue":{"value":{"entity-type":"item","numeric-id":57895,"id":"Q57895"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$EFEB16FC-767E-4284-99B5-B9FCD73734C8","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"32d1d77beb5f3bc65c221a38015efeb024af2386","datavalue":{"value":{"time":"+1994-11-06T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1315207$37F488C4-1071-4558-9F30-AEF120F06AE1","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"71ff24f66a8c292d90db239aac821e425c968846","datavalue":{"value":"Complex linear approximation, even with Haar systems suffers from the lack of information about the characterising number of extreme points of the error function. In a first step, the authors re-write the complex approximation problem in terms of an optimization problem. This problem is linear, but not finite. Thus, a certain discretization is used which yields a finite problem. Eventually, by combining the primal and the dual optimization problem, the authors reduce the problem to a set of equations.   They describe how to find an initial guess and to improve that guess. The improvement is done by treating the dual problem (in the spirit of Remez) by an exchange of a single point which corresponds to a single step in the simplex algorithm which increases the lower bound for the maximal error. The authors present a convergence proof, thereby correcting a proof by \\textit{P. T. P. Tang} [Ph. D. Thesis, Univ. of California at Berkeley (1987)].   Furthermore, the authors present two examples -- one is to find a Solotareff polynomial, the other consists of finding a certain approximation on an \\(L\\)-shaped region. The corresponding MATLAB code which was used is available.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315207$B9A8B645-F790-4BEE-947C-C72250B9C8EE","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1a49b11717c9633cc790210877f555360655234d","datavalue":{"value":"65E05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1315207$B9E337A8-38D5-4CEE-959A-96957A217E6D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1315207$02345460-903E-41C5-BC33-496B1CD0BF87","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"aa87693264bc3734c4430b4bf8f0fcd3cd11e0fc","datavalue":{"value":"90C34","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1315207$B1499BFF-CF97-4FA0-9CB2-377DD3226170","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"478c38ccba56b0dbac3ce562138b436c0d4370f1","datavalue":{"value":"30E10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1315207$56C6B8C2-0C2D-44C8-8F5C-867160C14D19","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"0962e89a9a589eeb3c025db425ebf4f567c513be","datavalue":{"value":"510206","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1315207$63CE313C-4368-41A8-B035-EC846650A96D","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0a0dc17bc58b703d600ebcce6c10e93243d856b1","datavalue":{"value":"semi-infinite-programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315207$58AEB6F2-06C2-47BB-B30E-46D43CA2BEAC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"035cc50250ad2cbcd727c9f8f95275a2cc2b2705","datavalue":{"value":"complex linear approximation","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315207$A0F40C0F-D735-4AC1-AC78-105FD28EC74D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a3b3cf701a0085264a36e2d3f375bd049437ffa5","datavalue":{"value":"primal and dual optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315207$DAA9D688-D34B-4C99-A72F-F1A845000A45","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f916828902258582a64d1f234a15b334b0a0b0f1","datavalue":{"value":"\\(L\\)-shaped region","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315207$8610068B-A81F-444A-8AB7-2A2B693FA78B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"be5f6ad2a8d3ddfb293e370e9d5eadeaf81b7e1a","datavalue":{"value":"Haar systems","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315207$A5DB8351-5899-4728-B8D2-794C71259CAA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"333b77b69e46d4bd7be3b503c6995846eac961dc","datavalue":{"value":"extreme points of the error function","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315207$8E2D1832-18C0-4078-8476-B2B0498E8598","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b2e693c2fb316708f6e0f61d4b0ded45ae0b8b3d","datavalue":{"value":"simplex algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315207$DFC03FD1-8A60-42F7-A30B-F7A26D89E14E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"03ee0109af41ad406ecd743518061baaa9e5e3ff","datavalue":{"value":"convergence","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315207$44DA7B13-628D-4C8B-96B4-F6A1A10B0E81","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cb019fdeff54877bb847ee9f43613ee85a9a5fc4","datavalue":{"value":"Solotareff polynomial","type":"string"},"datatype":"string"},"type":"statement","id":"Q1315207$74FFB664-079D-403F-9BD3-7E2724D439C0","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"ec13e33d0430e653f82ec4912b0cd30243b98007","datavalue":{"value":{"entity-type":"item","numeric-id":297576,"id":"Q297576"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$127A02DF-C8E1-4864-A502-38B5FADD90C9","rank":"normal"}],"P1463":[{"mainsnak":{"snaktype":"value","property":"P1463","hash":"5256c502562c9a17a1f1b9f13bba886b6920460c","datavalue":{"value":{"entity-type":"item","numeric-id":17144,"id":"Q17144"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$D72799E7-297D-417C-B7BD-E828E13F9F1B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1463","hash":"a709ac7c97c67049e241e0b036253f1d955c589a","datavalue":{"value":{"entity-type":"item","numeric-id":13313,"id":"Q13313"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$2906E0F9-30F9-4143-944B-19E65F81654C","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$EE99B3BA-C807-407A-A3C4-25E226B8D1F0","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"266d0d39d11744c5340231a664e1aff75392e5d3","datavalue":{"value":{"entity-type":"item","numeric-id":3744614,"id":"Q3744614"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$17EADE9E-E023-478D-A681-4533B5C2DC55","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"8572f7db0402a084b25bb91f546338837df87810","datavalue":{"value":{"entity-type":"item","numeric-id":4175044,"id":"Q4175044"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$2D7FAE11-AB1C-433F-BEA2-248AA377FC82","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"591237ed9ddc06d12b96f4fdf45176c199796a0b","datavalue":{"value":{"entity-type":"item","numeric-id":3913044,"id":"Q3913044"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$7080F468-C5F0-4D08-8024-B18B5F9372F2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ff66e2a6ce81ae478d62e719c5fd7bfae2114413","datavalue":{"value":{"entity-type":"item","numeric-id":3960031,"id":"Q3960031"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$3C167F4B-DAC5-41BA-B2B8-D8CBFC451E1D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"436dc2ac890659467052e8b899095e2a8d1cc3a8","datavalue":{"value":{"entity-type":"item","numeric-id":5531436,"id":"Q5531436"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$28A874E1-83C6-449E-847A-33F8C93AD450","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ef96478f77ca3c58bb0a366d5afaaa7362817af3","datavalue":{"value":{"entity-type":"item","numeric-id":1200545,"id":"Q1200545"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$9BEDDE00-9F49-46EE-B1F1-1AE58DDCC0B5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"51a7fdecbbb219dfbe59c2c7d5e228770a90852c","datavalue":{"value":{"entity-type":"item","numeric-id":3848306,"id":"Q3848306"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$C2FC70A1-C96E-4F86-9B01-79545ECC04CC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"e4e265569432f7767c48f89867c92d5d516c5add","datavalue":{"value":{"entity-type":"item","numeric-id":4692259,"id":"Q4692259"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$FACCA36E-E12F-408A-AECF-48A90FF965C2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"afcd044716a8e27bfdedb9d86fc84bff8929763d","datavalue":{"value":{"entity-type":"item","numeric-id":3477868,"id":"Q3477868"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$BBE64F9D-1020-48B4-B1E7-AA4DC83D1ED5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"cdcb09768cb7097281550695e9c2f908e53ccd95","datavalue":{"value":{"entity-type":"item","numeric-id":3978912,"id":"Q3978912"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1315207$A45AD6A6-FA84-4EBF-BF95-E5567CA98D05","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"32233c8666e32f27f157d06723e39733e67735b7","datavalue":{"value":{"entity-type":"item","numeric-id":3978912,"id":"Q3978912"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f7b3cb5ffde9fedbcbe7255323542f4d882ab431","datavalue":{"value":{"amount":"+0.8052104115486145","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1315207$78DE7B91-E4A2-4356-B070-F4FA4F3E2735","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"4733c6897e1129a65ae1fa3f184fb4748ffe4715","datavalue":{"value":{"entity-type":"item","numeric-id":3477868,"id":"Q3477868"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"304c37464729e613c525ae6831b6dd34d5a33adf","datavalue":{"value":{"amount":"+0.8006906509399414","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1315207$2515B84D-B686-4FA1-819D-3FE1A124DC11","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"67ddb1d70cd6970aaddd093975270fac221a9741","datavalue":{"value":{"entity-type":"item","numeric-id":4692259,"id":"Q4692259"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b2eecf6d9717bdcc68a9f2435f95bbf47ca40e2b","datavalue":{"value":{"amount":"+0.7878692746162415","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1315207$00EB2BF0-A54A-4B84-9F4D-8F5F582C36AC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"4a4b6069bdeeb290d12ccd0de81d267281d1c717","datavalue":{"value":{"entity-type":"item","numeric-id":4714755,"id":"Q4714755"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"eb953bee63e941e583257c151d7cf3bce8ab22c6","datavalue":{"value":{"amount":"+0.774971604347229","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1315207$05C394EA-AB39-489B-9A5B-1EAB676FF209","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An algorithm for complex linear approximation based on semi-infinite programming","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_algorithm_for_complex_linear_approximation_based_on_semi-infinite_programming"}}}}}