{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q3642004","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q3642004","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q3642004","kernelVersion":"v1","immutable":true,"modified":"2026-01-15T07:12:05Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q3642004","name":"Comparison of two kinds of approximate proximal point algorithms for monotone variational inequalities","headline":"Comparison of two kinds of approximate proximal point algorithms for monotone variational inequalities","description":"scientific article; zbMATH DE number 5631264","url":"https://portal.mardi4nfdi.de/entity/Q3642004","datePublished":"2009-11-11","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q291884"}]},"provenance":{"prov:generatedAtTime":"2026-01-15T07:12:05Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}