{"entities":{"Q95403":{"pageid":96701,"ns":120,"title":"Item:Q95403","lastrevid":56923371,"modified":"2026-03-24T16:47:50Z","type":"item","id":"Q95403","labels":{"en":{"language":"en","value":"nlsic"}},"descriptions":{"en":{"language":"en","value":"Non Linear Least Squares with Inequality Constraints"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"438d0eef0223375d3a92def8ffc6a10a8bf1ca95","datavalue":{"value":{"entity-type":"item","numeric-id":57080,"id":"Q57080"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q95403$F06B0690-D1CD-44DA-B80E-FB7B021B1025","rank":"normal"}],"P132":[{"mainsnak":{"snaktype":"value","property":"P132","hash":"d1e9e19fd2edbaf0373bb9c5fbe393acc65a69ee","datavalue":{"value":"1.0.2","type":"string"},"datatype":"string"},"type":"statement","qualifiers":{"P28":[{"snaktype":"value","property":"P28","hash":"5c6b20b4a57b0c3434160efd1366695eed4416ea","datavalue":{"value":{"time":"+2022-04-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"}]},"qualifiers-order":["P28"],"id":"Q95403$AF69985C-DE1D-4B26-8B55-C82284CCBAC8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P132","hash":"13fc6b6c359d9b413813f437afa63cada39dbe29","datavalue":{"value":"1.0.1","type":"string"},"datatype":"string"},"type":"statement","qualifiers":{"P28":[{"snaktype":"value","property":"P28","hash":"c55eb3ecc64f07fd602e06c6a37a740c982d0cb7","datavalue":{"value":{"time":"+2022-01-11T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"}]},"qualifiers-order":["P28"],"id":"Q95403$D81E267E-82ED-4298-B94C-DAADA440AEE6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P132","hash":"14770b42c368c3cd13371efe4cbf46ede33490fd","datavalue":{"value":"1.0.4","type":"string"},"datatype":"string"},"type":"statement","qualifiers":{"P28":[{"snaktype":"value","property":"P28","hash":"e1ff4eab0b2e0a25f5857bfddff310cd07acba57","datavalue":{"value":{"time":"+2023-06-26T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"}]},"qualifiers-order":["P28"],"id":"Q95403$E86B62D3-E3E7-4C77-8CD7-EF253BA06D8C","rank":"normal"}],"P19":[{"mainsnak":{"snaktype":"value","property":"P19","hash":"cd0d7783862c21e997ca6beb0e89ebfc41e498f5","datavalue":{"value":{"entity-type":"item","numeric-id":111365,"id":"Q111365"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q95403$B74BD50A-C126-4E15-803B-E838A7BA7AA0","rank":"normal"}],"P229":[{"mainsnak":{"snaktype":"value","property":"P229","hash":"565aba3fdd5fc1e7b9f8ea254b2a8a0527acd194","datavalue":{"value":"nlsic","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q95403$CBE7CE0F-29DF-400B-B60A-1B2E9696B24C","rank":"normal"}],"P114":[{"mainsnak":{"snaktype":"value","property":"P114","hash":"251fd109c2cd8c1ee39b48cd109c9f4b1c9fcf5c","datavalue":{"value":{"entity-type":"item","numeric-id":13519,"id":"Q13519"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q95403$AF0858A9-471E-44DD-B9B5-FCBBF1B38DB4","rank":"normal"}],"P170":[{"mainsnak":{"snaktype":"value","property":"P170","hash":"0b8a8989562b541e3f0db137a18aba7a533aeac3","datavalue":{"value":{"time":"+2023-06-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":"Q95403$F8497D6B-DE2D-487F-978B-2881E8009C54","rank":"normal"}],"P1459":[{"mainsnak":{"snaktype":"value","property":"P1459","hash":"ce957c42d68604295a40d7b34bfba8234e6d343c","datavalue":{"value":"We solve non linear least squares problems with optional    equality and/or inequality constraints. Non linear iterations are    globalized with back-tracking method. Linear problems are solved by    dense QR decomposition from 'LAPACK' which can limit the size of    treated problems. On the other side, we avoid condition number    degradation which happens in classical quadratic programming approach.    Inequality constraints treatment on each non    linear iteration is based on 'NNLS' method (by Lawson and Hanson).    We provide an original function 'lsi_ln' for solving linear least squares    problem with inequality constraints in least norm sens. Thus if Jacobian of    the problem is rank deficient a solution still can be provided.    However, truncation errors are probable in this case.    Equality constraints are treated by using a basis of Null-space.    User defined function calculating residuals must return a list having    residual vector (not their squared sum) and Jacobian. If Jacobian is    not in the returned list, package 'numDeriv' is used to calculated    finite difference version of Jacobian. The 'NLSIC' method was fist    published in Sokol et al. (2012) <doi:10.1093/bioinformatics/btr716>.","type":"string"},"datatype":"string"},"type":"statement","id":"Q95403$F23C123F-CEA0-4526-80FA-8221C3E3E02F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"ac294ba745c6aa29456f294c53e9fcc2cbc38262","datavalue":{"value":{"entity-type":"item","numeric-id":111365,"id":"Q111365"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q95403$363E45B7-A1F2-4EC6-B0F5-4A4DC7AFDBAD","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"caec58e2e2e3256bca461f95da85075ecd3567cd","datavalue":{"value":{"entity-type":"item","numeric-id":56623,"id":"Q56623"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q95403$B5A4E377-E3AD-4EC8-87F1-5F387131C25F","rank":"normal"}],"P342":[{"mainsnak":{"snaktype":"value","property":"P342","hash":"be2df5bb024adf8fb0914e4726f21690a2fce296","datavalue":{"value":{"entity-type":"item","numeric-id":23560,"id":"Q23560"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q95403$659D3658-1FE2-45B8-81C3-7566D97C52A3","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"7d83992ab8dbb8700bfd420fead4cb3698975ad5","datavalue":{"value":{"entity-type":"item","numeric-id":111368,"id":"Q111368"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q95403$CFACA7D7-0507-4733-A1B8-1E282C17F771","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q95403$6A1A0CC9-C7E5-4C52-8080-7AFC49252849","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Nlsic","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Nlsic"}}}}}