{"entities":{"Q1338808":{"pageid":1349547,"ns":120,"title":"Item:Q1338808","lastrevid":47282077,"modified":"2026-01-01T05:43:59Z","type":"item","id":"Q1338808","labels":{"en":{"language":"en","value":"A Cholesky dual method for proximal piecewise linear programming"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 691545"}},"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":"Q1338808$9F173920-1A19-45CC-8ED7-595556F1A562","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8f0c7ab1b6aa2c441054de813692ebb504d396ae","datavalue":{"value":{"text":"A Cholesky dual method for proximal piecewise linear programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1338808$83C0DB81-4135-458D-B616-719E25B31485","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"dd8e9cfe6b6026181c330e673af4afd52492104e","datavalue":{"value":"0822.65038","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1338808$20CEFB00-6518-43EF-BB05-2972F05E6495","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c4a9375c61b7877db49ec103b05a39f5a0c7c467","datavalue":{"value":{"entity-type":"item","numeric-id":173838,"id":"Q173838"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1338808$143353DF-C687-4D65-B6FA-926472A43784","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"1b3d1ca268e3dbdbae43efb5a69b3a469f08bcb8","datavalue":{"value":{"entity-type":"item","numeric-id":78127,"id":"Q78127"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1338808$9D78E452-0019-41ED-AFD5-F9830A250BD1","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"41ae9bdf8579f972d6336de39bcf8724740dccf0","datavalue":{"value":{"time":"+1995-10-15T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1338808$4DC07A4A-342A-49FD-978A-5D00AEBE5E85","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"baa8c75cbb54812b485d767f2c656d6a098cc50b","datavalue":{"value":"Let us consider the problem of the form: find an \\(n\\)-vector \\(x\\) to minimize  \\[ f(x):= ux^ T x/2+ \\sum_{i= 1}^ m c_ i f_ i(x) \\]  over all \\(x\\in X\\), where \\(u\\) is a positive scalar, \\(c_ i\\) are positive components of an \\(m\\)-vector \\(c\\), superscript \\(T\\) denotes transposition, \\(f_ i(X)= \\max\\{P_ j^ T x- a_ j: j\\in J_ i\\}\\), \\(i= 1,\\dots, m\\),   \\(X=\\{x: P_ j^ T x\\leq a_ j\\) \\(\\forall j\\in J_ 0\\}\\neq\\emptyset\\), \\(P_ j\\) denotes the \\(j\\)th column of an \\(n\\times m_ J\\) matrix \\(P\\), \\(m_ J\\) being the cardinality of the finite set \\(J= \\{1,2,\\dots, m_ J\\}\\) partitioned into \\(m+ 1\\) disjoint subsets \\(J_ i\\) for \\(i= 1,\\dots, m\\), \\(a_ j\\) are components of an \\(m_ J\\)-vector \\(a\\). One may rewrite this problem into an equivalent quadratic programming problem:   minimize \\(ux^ T x/2+ c^ T v\\) over all \\((x, v)\\in \\mathbb{R}^ n\\times \\mathbb{R}^ m\\) satisfying \\(P^ T x- H^ T v\\leq a\\)   or its dual problem:   minimize \\((P\\lambda)^ T (P\\lambda)/ 2u+ a^ T\\lambda\\) over all \\(\\lambda\\in \\mathbb{R}^{m_ J}\\) satisfying \\(H\\lambda= c\\), \\(\\lambda\\geq 0\\), where the \\(m\\times m_ J\\) matrix \\(H\\) has elements \\(H_{ij}= 1\\) if \\(j\\in J_ i\\) and \\(i\\geq 1\\), otherwise 0.   The author concentrates on the case when \\(X\\) is defined by the simple bounds \\(x^{\\text{low}}\\leq x\\leq x^{\\text{up}}\\) with given \\(n\\)- vectors \\(x^{\\text{low}}\\leq x^{\\text{up}}\\); the remaining \\(m_ L= m_ J- 2n\\) constraints will be called general constraints. He modifies his own recent algorithm [SIAM J. Sci. Stat. Comput. 10, No. 1, 175-186 (1989; Zbl 0663.65063)] solving the above dual problem with a classical active-set strategy, by replacing the QR-factorization by Cholesky factorization of the active general constraints. The obtained implementation reduces the space needs from about \\(3n^ 2/2\\) to \\(m_ L^ 2\\); moreover, some special techniques reduce the work per iteration.   The author proposes a unified way of finding generalized Newton directions in various cases, including hot starts and iterative refinement; this makes possible the updating of a Cholesky factorization of a certain matrix after row or column additions and deletions. The numerical experiments, done in sixteen-digit precision, suggest that the method is very suitable (robust and accurate enough) for nondifferentiable optimization problems; the author supposes that it is the only one suitable for large scale problems of this type.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1338808$5D908954-C199-4DD5-A8C2-913B7319042F","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1338808$CAFFDCAB-2165-4291-9814-254BDB159578","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b4d4b880941bb65ec306ce9d3141ff7e82566f56","datavalue":{"value":"90C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1338808$1E2EB089-796B-42CF-BCE9-10C39D572BFE","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"0958ff9b6298bef6e112ecc01f771ca6382066f7","datavalue":{"value":"691545","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1338808$9C6F0453-A914-4D6F-91F5-62BD6FF8C88A","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"aa5a21fb7ada341f101fe55294f9880674429adf","datavalue":{"value":"proximal piecewise linear programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1338808$521F1305-4D83-4EC8-9775-F94EB5BE78A4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0e69e213b51557cc1d7697165bed961e402ad508","datavalue":{"value":"quadratic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1338808$891DECE4-61D6-43F3-91E0-35C3C163ABE2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"34163758b63b89ef6dbdd9fbd7db311f982b8d85","datavalue":{"value":"dual problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q1338808$FEA99449-7D48-422D-9CD0-882BB16AD02D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"21cc8fb0a3dd34a7406e067da0ecb5802a58d51d","datavalue":{"value":"active-set strategy","type":"string"},"datatype":"string"},"type":"statement","id":"Q1338808$F8E5390C-D0C3-4B99-94A6-2FE49EC39260","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7f6bc657826185750962076fad6c753b75196875","datavalue":{"value":"QR-factorization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1338808$4E6ABD29-BB2F-4955-BDFC-ECA30B08CD62","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4bfe029cf803d365e9f0bdbfa7738c8886f7730d","datavalue":{"value":"Cholesky factorization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1338808$4F8B1A3F-15F6-4319-9DF4-3C0259407F24","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8ad86361ad64fc068dee97816cc2b63d57f6712d","datavalue":{"value":"iterative refinement","type":"string"},"datatype":"string"},"type":"statement","id":"Q1338808$201DC6E0-B94C-4CA3-8A49-5759B745F076","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4a5ad9ff03b17c8457e1ed84ec13768350695ce6","datavalue":{"value":"numerical experiments","type":"string"},"datatype":"string"},"type":"statement","id":"Q1338808$CD4D40EC-3E00-4359-AACE-56BF97AA6DE2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"98a45f34683be72a29a00ff0dbefdce85b1f6c47","datavalue":{"value":"nondifferentiable optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1338808$CEA2CCFB-5E0F-4F37-AD34-4397F2DDDD96","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2f94589b2f9ccfc1f1211e94ccf7e766f7a016d3","datavalue":{"value":"large scale problems","type":"string"},"datatype":"string"},"type":"statement","id":"Q1338808$B7C55949-F3F0-470C-9DEF-8E08F63FF55D","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"d5fd5ff183c0604d4604d01e4d7272b9df444640","datavalue":{"value":{"entity-type":"item","numeric-id":593684,"id":"Q593684"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1338808$8B63DD45-7D4E-4C0F-88E3-0911B5C345DE","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":"Q1338808$58F79E5B-9DF5-44DE-8F57-1E83BD961BE2","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"e8ade1ce9e68fccf3339b89e03116027a67cc88c","datavalue":{"value":"https://doi.org/10.1007/s002110050065","type":"string"},"datatype":"url"},"type":"statement","id":"Q1338808$7D4BBD90-1B9C-437B-B2A3-1F8589E4C232","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"0b970a49bed1a790d404837976a37fb9a956b579","datavalue":{"value":"W2087580994","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1338808$AAF78E0E-AE75-4D8A-964A-80E7EB2AAF58","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"9f0be3874b4ca8d26d9844b2f0917ac5eda5953e","datavalue":{"value":"10.1007/S002110050065","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1338808$13D11A04-D106-4C2F-A21C-A61F7CAE2CBA","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"36b87ce9a9a48dd27b9de87b1bbe4fdcca91109d","datavalue":{"value":{"entity-type":"item","numeric-id":3835659,"id":"Q3835659"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"a2b6132dcb37c1e9bb6b681787ea8e47acae0e3f","datavalue":{"value":{"amount":"+0.7826828360557556","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":"Q1338808$7E1CD1C6-E2E3-413F-BEEA-BC74B2CDF64E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"46e3f8d25a2af7b43bc504eb40c274cebd752120","datavalue":{"value":{"entity-type":"item","numeric-id":4367421,"id":"Q4367421"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e021b2af36db382b1b7403d58d26bb7f02b4b3a0","datavalue":{"value":{"amount":"+0.7802866697311401","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":"Q1338808$255BB046-7955-4178-8714-74A27E15FC31","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"413bcc91d90229cd9b0352ac1ef298f79682d037","datavalue":{"value":{"entity-type":"item","numeric-id":59165,"id":"Q59165"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b0ae1881d6be577065d7b6454a4d7a5009cd18b0","datavalue":{"value":{"amount":"+0.7788093686103821","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":"Q1338808$3D7DEB8D-1D61-4DE4-A13D-BEF58F9D8B05","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"0f76e5bd790b6ca5d44b3995e11e7cceb6a3bf17","datavalue":{"value":{"entity-type":"item","numeric-id":3813167,"id":"Q3813167"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4d82ef575b1e2c6e6e18f290ebb60d1503824bda","datavalue":{"value":{"amount":"+0.7597054839134216","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":"Q1338808$0B88419A-9BCA-4632-81B4-52DE8BA7BD10","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"43586c9b18dd732ef782a7eccd365598f9915997","datavalue":{"value":{"entity-type":"item","numeric-id":3197624,"id":"Q3197624"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"8fc51fe7b0fc1df5f294ad395f5e483955256a0d","datavalue":{"value":{"amount":"+0.7595382332801819","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":"Q1338808$4663A8B2-C42B-4177-A77F-28243B934784","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:1338808","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:1338808"}}}}}