{"entities":{"Q1123811":{"pageid":1134560,"ns":120,"title":"Item:Q1123811","lastrevid":66178674,"modified":"2026-04-12T08:04:33Z","type":"item","id":"Q1123811","labels":{"en":{"language":"en","value":"A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4110471"}},"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":"Q1123811$B86FDDB1-F378-4D52-80C6-99085759EDE0","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0d5863d7f6b863935c8b13e9417b1397b20933e8","datavalue":{"value":{"text":"A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1123811$E502B38F-CA71-44C6-9B10-8729277FB3AE","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"cd32ec69aeafa9a53203fa243446bdc17d254c57","datavalue":{"value":"0677.90061","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1123811$4B46ED68-9D7A-4402-A425-3EBC2AAB1F71","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8c876bdd30ff8016c13bc4fd3988eeb7e0447352","datavalue":{"value":"10.1007/BF01582280","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1123811$8CCA37D1-A6F2-4A46-800A-EE7C14B777F1","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b655a2b55f51b64482e68d22aa2b7d501ad81c42","datavalue":{"value":{"entity-type":"item","numeric-id":1123810,"id":"Q1123810"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1123811$CA0B9A03-38ED-4E17-83BF-55BFD1232316","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"83958bb5fb550f2bcc4b0a9c66dfd309bc9a79e4","datavalue":{"value":{"entity-type":"item","numeric-id":1016402,"id":"Q1016402"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1123811$EFDDAD20-953D-41B1-958D-9ACBE0BD99CD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"69a24f0f8f411ca7218f0c2eeb4324c7e6a2d8a2","datavalue":{"value":{"entity-type":"item","numeric-id":417334,"id":"Q417334"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1123811$BB85BC5B-322A-46D4-8DC9-DEEE72D9F385","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"99da72655942e9c2c9c01874c026b7cceeb02de6","datavalue":{"value":{"entity-type":"item","numeric-id":163006,"id":"Q163006"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1123811$E602289B-F759-438D-8373-CBF6E9FD003B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"7211ad5ca16eb0d22cd0051fff3d0f3af254ceb6","datavalue":{"value":{"time":"+1989-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1123811$5DCE4B90-6228-472C-880F-3D121C1767A1","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"536892516c1a94a5c8e34dc3eed3958d1a1d8fe9","datavalue":{"value":"The authors study the performance of some rank-two ellipsoid algorithms using well-known nonlinear programming problems. Numerical experiments are reported which show tht the rank-two algorithms studied are slightly less efficient than the usual center-cut (rank-one) method. Some results are also presented concerning the growth of ellipsoid asphericity in rank-one and rank-two algorithms.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1123811$78B1895D-A470-4D90-B88F-AC7155114483","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"52de7d4bf5a27d5ad252804eec58396bb3e40c44","datavalue":{"value":"90C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1123811$AC839630-8AC6-4F62-B458-3919512668C2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1123811$75197072-2D2B-4A04-93EF-2A73D61747E3","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c41a3f35e89b07d00ee9b2ddf739bffef706fcdf","datavalue":{"value":"4110471","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1123811$BD91FC8D-39A8-415D-897B-3D1868C70173","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1af816875046b8475b46e0607e30b6c20a3b8dd4","datavalue":{"value":"rank-two ellipsoid algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q1123811$D0EAEA1B-A9E9-40BB-BFA3-4D5384162474","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"719ed930d7b23331709e18495f2302eeea09df85","datavalue":{"value":"Numerical experiments","type":"string"},"datatype":"string"},"type":"statement","id":"Q1123811$E6D40140-32CA-4B1A-B37B-A6DFDF36944F","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":"Q1123811$FE347605-A624-4160-98C3-499F624FAA8E","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"4f11510ea530a02e2740d6070dbf650080ce92fd","datavalue":{"value":{"entity-type":"item","numeric-id":3929391,"id":"Q3929391"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1123811$F90073A2-553E-470F-9430-A8F93AED7748","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"c164141ca3b02a5d334a97accf9c96f2efbbd844","datavalue":{"value":{"entity-type":"item","numeric-id":5630864,"id":"Q5630864"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1123811$ABDB7076-CF7B-454B-9E8C-352C3179D7E1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"7ee57f2795bf342bf5e51dc73cdfa949afa436b1","datavalue":{"value":{"entity-type":"item","numeric-id":4120280,"id":"Q4120280"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1123811$904B6382-42D4-4B98-BD3F-5A6E04D51CA2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"6c8076fe24bd8412e806097e15241671946ca713","datavalue":{"value":{"entity-type":"item","numeric-id":3325476,"id":"Q3325476"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1123811$E94E0D6C-D48B-4EBC-8A07-ACFEA93CF1F4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"3b139fdd4e6c22ef5aa1c3a4a9b5745c814ae69a","datavalue":{"value":{"entity-type":"item","numeric-id":3040934,"id":"Q3040934"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1123811$A2AFCADB-D9A5-4590-99F5-C46A1211CB02","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"b5a595c7d1a970c42435c3d5ce955a01b213e646","datavalue":{"value":{"entity-type":"item","numeric-id":3705225,"id":"Q3705225"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1123811$F3228BCF-D3C5-4CD3-9722-204B3E3E7FAA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ab90871508db5b3562a80f563559e6f62a7c8d09","datavalue":{"value":{"entity-type":"item","numeric-id":3337214,"id":"Q3337214"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1123811$37AF9666-E655-417C-9284-EBEC93B7051F","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"2bbacf5c4ddca257c251990c7d0081739b3f199f","datavalue":{"value":{"entity-type":"item","numeric-id":3705225,"id":"Q3705225"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d0aa297d22a307258f1f9ae9c2f5d57140da9091","datavalue":{"value":{"amount":"+0.8349876999855042","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":"Q1123811$4C21438E-465D-4EFD-9E8D-43DB3BE39F11","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"51c84c8ea517f73eb1838f5d2560cda4ba2f6beb","datavalue":{"value":{"entity-type":"item","numeric-id":3325476,"id":"Q3325476"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"735af26a58770fef3caf857b70ab9a3093a796e8","datavalue":{"value":{"amount":"+0.8058714866638184","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":"Q1123811$DC2EB759-9D95-47F1-A4EB-F3285AF32292","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3050f42590547462ef8feb8f8adbd8e51da117cf","datavalue":{"value":{"entity-type":"item","numeric-id":3707772,"id":"Q3707772"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ee99c58098a967868e757c2364b17cafebd82f3f","datavalue":{"value":{"amount":"+0.7913093566894531","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":"Q1123811$28E85BA2-F9B4-4C15-9A5A-B57087AC0A22","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"97c5e9f838d638d378de8186b97785934b10cb9c","datavalue":{"value":{"entity-type":"item","numeric-id":1337226,"id":"Q1337226"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d1ad5083145cec68e646ce6beb872fb54d292cde","datavalue":{"value":{"amount":"+0.781821608543396","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":"Q1123811$27EC4250-4534-44BA-8817-12F484552900","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"23ff79f3f923c656f61da467c23e6d9351fa81c7","datavalue":{"value":{"entity-type":"item","numeric-id":5289572,"id":"Q5289572"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d1ad5083145cec68e646ce6beb872fb54d292cde","datavalue":{"value":{"amount":"+0.781821608543396","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":"Q1123811$AD114063-B6B4-453D-9A47-6B4697F2C06E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_numerical_investigation_of_rank-two_ellipsoid_algorithms_for_nonlinear_programming"}}}}}