{"entities":{"Q1109685":{"pageid":1120434,"ns":120,"title":"Item:Q1109685","lastrevid":66451089,"modified":"2026-04-12T10:09:55Z","type":"item","id":"Q1109685","labels":{"en":{"language":"en","value":"Successive approximation technique for a class of large-scale NLP problems and its application to dynamic programming"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4070645"}},"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":"Q1109685$82F03C84-C3EE-4F45-AE22-9786CFC2C626","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"cf2c59c77198da002bb714170ae20ac5c11de178","datavalue":{"value":{"text":"Successive approximation technique for a class of large-scale NLP problems and its application to dynamic programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1109685$62F94A90-76A8-42EB-BAB0-2A0F321DFDF1","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"7fffcab7ffd971276bb8f638beac6677fb572003","datavalue":{"value":"0655.90067","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1109685$F19E7AC4-7938-48C6-8C65-EC74C72297AF","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ee5037439f57e1a42525a51da70059f233aa3ed5","datavalue":{"value":"10.1007/BF00939819","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1109685$F7596AE8-C51B-4958-BD68-F27B4519D62E","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"aedf720352fcca932fab3523c4bbcafd7c4c7cdb","datavalue":{"value":{"entity-type":"item","numeric-id":1104176,"id":"Q1104176"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1109685$15C3A7E8-E242-4E47-9428-DC740E5B86B4","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"a3c8bf4d8569c126380a9fc42f55609089e776fb","datavalue":{"value":{"entity-type":"item","numeric-id":82026,"id":"Q82026"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1109685$306B6F00-5A92-4F8F-A111-B2CB6589FD00","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":"Q1109685$0D9AF567-ACE5-45AF-8A2C-62A87B2BEB1A","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"f738ba78a1e0619eb7ecd89251aa906979ab6b38","datavalue":{"value":"Two successive approximation techniques are presented for a class of large-scale nonlinear programming problems with decomposable constraints and a class of high-dimensional discrete optimal control problems respectively. It is shown that: (a) the accumulation point of the sequence produced by the first method is a Kuhn-Tucker point if the constraint functions are decomposable and if the uniqueness condition holds; (b) the sequence converges to an optimum solution if the objective function is strictly pseudoconvex and if the constraints functions are decomposable and quasiconcave; and (c) similar conclusions for the second method hold also for a class of discrete optimal control problems under some assumptions.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1109685$FD964700-D025-490D-B772-4254E4E6C679","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"52de7d4bf5a27d5ad252804eec58396bb3e40c44","datavalue":{"value":"90C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1109685$9CEBB4A2-9195-479F-8A2A-875820D22053","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"aa3ca91474fff28e420d9cace433f8447ec799b0","datavalue":{"value":"90C39","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1109685$6548D29D-FCC7-4C78-A9C4-8263F28CCB67","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1109685$8365D103-C861-46E0-B68C-CC777BC720FA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"012e86f9177c24e37dcdc94857f238df2620f196","datavalue":{"value":"49M37","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1109685$3D7FD86C-3FE3-47DF-B73C-9C230D8EBB0A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"07509cc2f0bb987328b2eec7e5f2aaab31108789","datavalue":{"value":"4070645","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1109685$B42F002C-354D-4C64-9174-C9E7B3989327","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"91d973404fed608cd13b8620e658c86235c0f590","datavalue":{"value":"successive approximation techniques","type":"string"},"datatype":"string"},"type":"statement","id":"Q1109685$5C80878F-7067-4ECE-A9DA-FFFB6BED2B14","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f297d6a75f945f3358a8a80c0a616348cdf2c5f4","datavalue":{"value":"large-scale nonlinear programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1109685$DD75EB4D-42A3-4B34-B00B-DF5A7E8CBAF5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9f6976ddb2d25722e2f441e335f9d41a4c2cafe9","datavalue":{"value":"decomposable constraints","type":"string"},"datatype":"string"},"type":"statement","id":"Q1109685$F8FFDDDB-DB88-40E6-AFD5-29F61D612C1F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b937c12c2e927028fa3813dd9fbc1a8c918bd773","datavalue":{"value":"high-dimensional discrete optimal control","type":"string"},"datatype":"string"},"type":"statement","id":"Q1109685$E33C06ED-2154-49B9-8789-AAA8E0BD0BE2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c17ca1fd0c774657fe619165e1192d2bc16ae57a","datavalue":{"value":"Kuhn-Tucker point","type":"string"},"datatype":"string"},"type":"statement","id":"Q1109685$69129381-06B3-45A4-BBF7-95DB9D5E1A59","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4287c4bd9c92ecd352ae726f196f62740d829563","datavalue":{"value":"nonconvex optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1109685$DDD4837C-6C79-4F90-9756-BFB51B71207A","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":"Q1109685$E8CDE29C-2C87-46BE-B539-54DF8C22DEC7","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"a308e30505dd380998190c7f81f45679fe7a55a5","datavalue":{"value":{"entity-type":"item","numeric-id":3292915,"id":"Q3292915"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1109685$8434AAED-AE8E-44E9-8C4E-A53AEBC4DBFE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"3aa14a8af4d4f852ae99a691fa718a2da2f92bb3","datavalue":{"value":{"entity-type":"item","numeric-id":3947446,"id":"Q3947446"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1109685$C9EF535B-B5C8-4540-8053-09264F38DD5F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"a3a2ac98423fc04b8da1b5b2a11b311dfcc00db1","datavalue":{"value":{"entity-type":"item","numeric-id":4135211,"id":"Q4135211"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1109685$50D30303-07C1-4060-9BD2-053A0190C113","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"9120182305789ab98d969113bb1efce927d9bd4b","datavalue":{"value":{"entity-type":"item","numeric-id":1227532,"id":"Q1227532"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1109685$28EBE644-7123-4534-8BA6-2DF7DB494F06","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"eb7c89564df1b58c5b5f92ef12f334fbe999bc96","datavalue":{"value":{"entity-type":"item","numeric-id":5594968,"id":"Q5594968"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"844adafb0b4e6e8d004a573f66d3ec772a8ca67a","datavalue":{"value":{"amount":"+0.7939862012863159","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":"Q1109685$8323D9FD-824F-43AD-A290-850B73B5DC63","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"801cabdae2db1bef1a3cb323cff442cb9b494b18","datavalue":{"value":{"entity-type":"item","numeric-id":4723581,"id":"Q4723581"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"8b43fc2ca744827a55bdad429764cac3701855f0","datavalue":{"value":{"amount":"+0.7828241586685181","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":"Q1109685$6E094226-39EB-469C-AF50-4E6E9908B85A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"51701e0fc75344eed50b936dca948e2592991162","datavalue":{"value":{"entity-type":"item","numeric-id":3740583,"id":"Q3740583"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"7e5349855ad36ffc3e25ec687f49ec22e674de97","datavalue":{"value":{"amount":"+0.7744088172912598","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":"Q1109685$859F7848-279A-43AA-9B5E-ACB8A8BBDBD5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"db6626143f4e0375fea2c4f8d03e2fe5e722d3b3","datavalue":{"value":{"entity-type":"item","numeric-id":3730353,"id":"Q3730353"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"0bfa6151ff7ca02b9b9080fabd48b2a14680af87","datavalue":{"value":{"amount":"+0.7698319554328918","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":"Q1109685$1A924605-2DA9-411C-8091-A013CF62A431","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"03377677742b9150bc45db4796cffbcafecf8bf2","datavalue":{"value":{"entity-type":"item","numeric-id":4712567,"id":"Q4712567"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c5a06248e827578ee65dce559650002184178b27","datavalue":{"value":{"amount":"+0.7661742568016052","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":"Q1109685$27A271D1-B53A-4E57-89B9-0C679B794A97","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Successive approximation technique for a class of large-scale NLP problems and its application to dynamic programming","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Successive_approximation_technique_for_a_class_of_large-scale_NLP_problems_and_its_application_to_dynamic_programming"}}}}}