{"entities":{"Q6893682":{"pageid":20858620,"ns":120,"title":"Item:Q6893682","lastrevid":75451543,"modified":"2026-04-19T03:17:51Z","type":"item","id":"Q6893682","labels":{"en":{"language":"en","value":"An equivalent reformulation and multiproximity gradient algorithms for a class of nonsmooth fractional programming"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8128102"}},"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":"Q6893682$536B8545-92CB-4239-937C-7F13D8EF73F9","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"e54ccf3bdef61b36ebb0c1a397d95c81c8d1314c","datavalue":{"value":{"text":"An equivalent reformulation and multiproximity gradient algorithms for a class of nonsmooth fractional programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6893682$C486355B-1B93-4BD8-9481-EF7E2FE6B024","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"c796c4bfe1565fc71ea375c5e4f273fe881f658a","datavalue":{"value":"10.1287/MOOR.2024.0457","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6893682$1A38B902-F9C2-43AA-8FC9-1D7A2CD3EE8B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0995115c5e985de90af452e25b569d9ca66e5050","datavalue":{"value":{"entity-type":"item","numeric-id":2053671,"id":"Q2053671"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6893682$30BB127D-E757-4029-B8F8-6BEAC27E938B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"88b5f2a31bea02b4db499a9095685a4ccd79829c","datavalue":{"value":{"entity-type":"item","numeric-id":230339,"id":"Q230339"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6893682$A563746F-7389-4F1C-A0B6-917F239D4F00","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"bf31fe8a976a9819ac07bec6a2975a55ea340fe5","datavalue":{"value":{"entity-type":"item","numeric-id":654454,"id":"Q654454"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6893682$17A6412D-6F4D-4644-B961-80F7CC18D7B6","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"cccce4a4205b51ff587d222bc7a07ed4bfa86d8f","datavalue":{"value":{"entity-type":"item","numeric-id":103831,"id":"Q103831"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6893682$4AA5A43A-DBCE-4B65-A20B-E5A0EECD48BA","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"46b64429f4db778a47f40be8c6fa42e140125f60","datavalue":{"value":{"time":"+2025-11-26T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6893682$4C9F5726-734D-42E5-BDF1-84EBF56DC8E5","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"3f4043530c5f766fce7f22c6a8360848f2544197","datavalue":{"value":"90C32","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6893682$C5EDF13E-A9A8-4926-920F-76F7F0CCC3C5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed10a41ec587cb61dc683f25ef4b3e827c7fee2f","datavalue":{"value":"90C26","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6893682$FCFEA75E-BBF2-4DE5-B473-FACED7742A4E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"52de7d4bf5a27d5ad252804eec58396bb3e40c44","datavalue":{"value":"90C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6893682$8D49AB1E-3642-47D9-9C30-A2B07F2EE936","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6893682$4F88D722-7380-4921-BAE0-2F68FB3AF919","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"a5a35d8b9c0f55a8ee1efd88aad1c55055fc43d7","datavalue":{"value":"8128102","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6893682$2D5F7E6B-2751-4592-8A7A-723D77FA51F1","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d2411eedf2fbf907020e09924a51f80905226649","datavalue":{"value":"fractional programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q6893682$368C0E80-2FDD-4EB6-A1A7-D831A82A49C6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"24c3952e28de482f8cc1242688f33cb870cb3ad2","datavalue":{"value":"equivalent reformulation","type":"string"},"datatype":"string"},"type":"statement","id":"Q6893682$A898A67C-A696-479C-B580-B90E57A95140","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a7f85764df0a32e0ca432da60ad36b97d528766e","datavalue":{"value":"proximal algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6893682$A6F54BCC-90DF-4F19-B74B-1F7D718AA6E2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8fa834945112299f39c9954f7bae834ead6030d4","datavalue":{"value":"KL exponent","type":"string"},"datatype":"string"},"type":"statement","id":"Q6893682$F07A45F1-0648-4994-9351-6F5C4CC33B44","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":"Q6893682$F8CA13A4-8225-46A7-8F36-FAB6C83063CA","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An equivalent reformulation and multiproximity gradient algorithms for a class of nonsmooth fractional programming","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_equivalent_reformulation_and_multiproximity_gradient_algorithms_for_a_class_of_nonsmooth_fractional_programming"}}}}}