Composite Optimization by Nonconvex Majorization-Minimization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Composite Optimization by Nonconvex Majorization-Minimization

Many tasks in imaging can be modeled via the minimization of a nonconvex composite function. A popular class of algorithms for solving such problems are majorizationminimization techniques which iteratively approximate the composite nonconvex function by a majorizing function that is easy to minimize. Most techniques, e.g. gradient descent, utilize convex majorizers in order guarantee that the ...

متن کامل

Parallel Majorization Minimization with Dynamically Restricted Domains for Nonconvex Optimization

We propose an optimization framework for nonconvex problems based on majorizationminimization that is particularity well-suited for parallel computing. It reduces the optimization of a high dimensional nonconvex objective function to successive optimizations of locally tight and convex upper bounds which are additively separable into low dimensional objectives. The original problem is then brok...

متن کامل

On the Global Convergence of Majorization Minimization Algorithms for Nonconvex Optimization Problems

In this paper, we study the global convergence of majorization minimization (MM) algorithms for solving nonconvex regularized optimization problems. MM algorithms have received great attention in machine learning. However, when applied to nonconvex optimization problems, the convergence of MM algorithms is a challenging issue. We introduce theory of the KurdykaLojasiewicz inequality to address ...

متن کامل

Parallel Majorization Minimization with Dynamically Restricted Domains for Nonconvex Optimization: Supplementary Material

We provide proofs for the theorems presented in the main paper and additional numerical examples. 1 Proofs of Theorems and Lemmas 1.1 Proof of Lemma 2.1 Proof First, we need to verify that the conditions in (3)–(7) are satisfied. It follows directly from (14) that F̄ (θ̂; θ̂) = F (θ̂) and ∇θF̄ |θ=θ̂ = ∇θF |θ=θ̂ so (4)–(5) are satisfied. Also, by construction the entries of D in (15) are non-negative s...

متن کامل

On Iterated Minimization in Nonconvex Optimization

In dynamic programming and decomposition methods one often applies an iterated minimization procedure. The problem variables are partitioned into several blocks, say x and y. Treating y as a parameter, the first phase consists of minimization with respect to the variable x. In a second phase the minimization of the resulting optimal value function depending on y is considered. In this paper we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Imaging Sciences

سال: 2018

ISSN: 1936-4954

DOI: 10.1137/18m1171989