{"id":24128,"date":"2025-03-16T17:25:54","date_gmt":"2025-03-16T14:25:54","guid":{"rendered":"https:\/\/w3.bilkent.edu.tr\/en\/?p=24128"},"modified":"2025-03-17T20:57:46","modified_gmt":"2025-03-17T17:57:46","slug":"math-seminar-separable-bregman-framework-for-sparsity-constrained-nonlinear-optimization-mustafa-celebi-pinar-340pm-march-17-2025-en","status":"publish","type":"post","link":"https:\/\/w3.bilkent.edu.tr\/en\/math-seminar-separable-bregman-framework-for-sparsity-constrained-nonlinear-optimization-mustafa-celebi-pinar-340pm-march-17-2025-en\/","title":{"rendered":"MATH Seminar: \u201cSeparable Bregman Framework For Sparsity Constrained Nonlinear Optimization\u201d, Mustafa \u00c7elebi P\u0131nar, 3:40PM March 17 2025 (EN)"},"content":{"rendered":"<p>You are cordially invited to the Analysis Seminar organized by the Department of Mathematics.<\/p>\n<p>Speaker: Mustafa \u00c7elebi P\u0131nar (Bilkent)<\/p>\n<p>\u201cSeparable Bregman Framework For Sparsity Constrained Nonlinear Optimization\u201d<\/p>\n<p>Abstract: We consider the minimization of a continuously differentiable function over a cardinality constraint. We focus on smooth and relatively smooth functions. These smoothness criteria result in new descent lemmas. Based on the new descent lemmas, novel optimality conditions and algorithms are developed, which extend the previously proposed hard-thresholding algorithms. We give a theoretical analysis of these algorithms, and reproduce a convergence result with elementary analysis techniques. In particular, we focus on the square of the weighted l_2 norm.<br \/>\nWe apply our algorithms to compressed sensing problems to demonstrate the theoretical findings and the enhancements achieved through the proposed framework.<\/p>\n<p>Date: Monday, March 17, 2025<br \/>\nTime: 15:40 \u2013 16:40<br \/>\nPlace: Mathematics Seminar Room, SA \u2013 141<\/p>\n","protected":false},"excerpt":{"rendered":"<p>You are cordially invited to the Analysis Seminar organized by the Department of Mathematics. Speaker: Mustafa \u00c7elebi P\u0131nar (Bilkent) \u201cSeparable Bregman Framework For Sparsity Constrained Nonlinear Optimization\u201d Abstract: We consider the minimization of a continuously differentiable function over a cardinality constraint. We focus on smooth and relatively smooth functions. These [\u2026] <\/p>\n<div class=\"clear\"><\/div>\n<p><a class=\"more_link clearfix\" href=\"https:\/\/w3.bilkent.edu.tr\/en\/math-seminar-separable-bregman-framework-for-sparsity-constrained-nonlinear-optimization-mustafa-celebi-pinar-340pm-march-17-2025-en\/\" rel=\"nofollow\">Read More<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[12],"tags":[],"class_list":["post-24128","post","type-post","status-publish","format-standard","hentry","category-oldposts"],"_links":{"self":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts\/24128","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/comments?post=24128"}],"version-history":[{"count":1,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts\/24128\/revisions"}],"predecessor-version":[{"id":24129,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/posts\/24128\/revisions\/24129"}],"wp:attachment":[{"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/media?parent=24128"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/categories?post=24128"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/w3.bilkent.edu.tr\/en\/wp-json\/wp\/v2\/tags?post=24128"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}