{"entities":{"Q6522053":{"pageid":14101015,"ns":120,"title":"Item:Q6522053","lastrevid":95420168,"modified":"2026-06-05T09:01:30Z","type":"item","id":"Q6522053","labels":{"en":{"language":"en","value":"Improved SQP and SLSQP Algorithms for Feasible Path-based Process Optimisation"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"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":"Q6522053$43F8389E-2278-4450-ADFF-801B931B20BA","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"6b041cbd73ca122aaa8a5cc81da1211211a272d8","datavalue":{"value":{"text":"Improved SQP and SLSQP Algorithms for Feasible Path-based Process Optimisation","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6522053$75444D17-DF2C-4407-90B2-3124E952AAC7","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"8c1aa526fee3be0d5e0f6c4a80ce98f9f83ba4e4","datavalue":{"value":{"entity-type":"item","numeric-id":458568,"id":"Q458568"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6522053$B0265CDB-0338-48D3-8C36-5B45EBC2E79C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f9dbf8e66798e5eb488b876c995ccd2a58f3beb3","datavalue":{"value":{"entity-type":"item","numeric-id":1665152,"id":"Q1665152"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6522053$3B262C55-B88B-4D78-9E43-3D174F9AEF34","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d376e1381b62128daec561e2ba7a63706d9d3b41","datavalue":{"value":{"entity-type":"item","numeric-id":275163,"id":"Q275163"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6522053$E91D5B20-51DB-44C0-8C1A-EA0DB27C2283","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"44f8a8045a5bdbe2edcb97dc59a5bd254ed58ff8","datavalue":{"value":{"entity-type":"item","numeric-id":167915,"id":"Q167915"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6522053$CCF81357-BD6D-48FD-87CE-E087B1C0EB51","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":"Q6522053$8889B4F2-EB5C-49BF-9EF3-5FF15575B988","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"ced7ee8273c266210f49b90be44ac8a2b8e846f7","datavalue":{"value":"2402.10396","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6522053$B751BCDA-03D6-4BD5-A81A-CC119D0438D1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Improved SQP and SLSQP Algorithms for Feasible Path-based Process Optimisation","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Improved_SQP_and_SLSQP_Algorithms_for_Feasible_Path-based_Process_Optimisation"}}}}}