{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1361981469697244544.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1007/s10107-007-0133-5"}},{"identifier":{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/s10107-007-0133-5.pdf"}},{"identifier":{"@type":"URI","@value":"http://link.springer.com/article/10.1007/s10107-007-0133-5/fulltext.html"}},{"identifier":{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/s10107-007-0133-5"}}],"dc:title":[{"@value":"On the convergence of the proximal algorithm for nonsmooth functions involving analytic features"}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1381981469697244545","@type":"Researcher","foaf:name":[{"@value":"Hedy Attouch"}]},{"@id":"https://cir.nii.ac.jp/crid/1381981469697244544","@type":"Researcher","foaf:name":[{"@value":"Jérôme Bolte"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"00255610"},{"@type":"EISSN","@value":"14364646"}],"prism:publicationName":[{"@value":"Mathematical Programming"}],"dc:publisher":[{"@value":"Springer Science and Business Media LLC"}],"prism:publicationDate":"2007-05-04","prism:volume":"116","prism:number":"1-2","prism:startingPage":"5","prism:endingPage":"16"},"reviewed":"false","dc:rights":["http://www.springer.com/tdm"],"url":[{"@id":"http://link.springer.com/content/pdf/10.1007/s10107-007-0133-5.pdf"},{"@id":"http://link.springer.com/article/10.1007/s10107-007-0133-5/fulltext.html"},{"@id":"http://link.springer.com/content/pdf/10.1007/s10107-007-0133-5"}],"createdAt":"2007-05-03","modifiedAt":"2020-04-21","relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360285706318035840","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"A refined convergence analysis of \n                \n                  \n                \n                $$\\hbox {pDCA}_{e}$$\n                \n                  \n                    \n                      pDCA\n                      e\n                    \n                  \n                \n               with applications to simultaneous sparse recovery and outlier detection"}]},{"@id":"https://cir.nii.ac.jp/crid/1360298757204470912","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity"}]},{"@id":"https://cir.nii.ac.jp/crid/1360580229791607808","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"New Bregman proximal type algorithms for solving DC optimization problems"}]},{"@id":"https://cir.nii.ac.jp/crid/1360869856047777152","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Approximate bregman proximal gradient algorithm for relatively smooth nonconvex optimization"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1007/s10107-007-0133-5"},{"@type":"CROSSREF","@value":"10.1007/s10589-019-00067-z_references_DOI_UUjPbzRrKySB9AWcudwH73oeGI6"},{"@type":"CROSSREF","@value":"10.1137/21m140376x_references_DOI_UUjPbzRrKySB9AWcudwH73oeGI6"},{"@type":"CROSSREF","@value":"10.1007/s10589-022-00411-w_references_DOI_UUjPbzRrKySB9AWcudwH73oeGI6"},{"@type":"CROSSREF","@value":"10.1007/s10589-024-00618-z_references_DOI_UUjPbzRrKySB9AWcudwH73oeGI6"}]}