Iterative reweighted methods for $$\ell _1-\ell _p$$ℓ1-ℓp minimization
نویسندگان
چکیده
منابع مشابه
Maximum Consensus Parameter Estimation by Reweighted \ell _1 ℓ 1 Methods
Robust parameter estimation in computer vision is frequently accomplished by solving the maximum consensus (MaxCon) problem. Widely used randomized methods for MaxCon, however, can only produce random approximate solutions, while global methods are too slow to exercise on realistic problem sizes. Here we analyse MaxCon as iterative reweighted algorithms on the data residuals. We propose a smoot...
متن کاملPerformance of first- and second-order methods for \(\ell _1\) -regularized least squares problems
We study the performance of firstand second-order optimization methods for `1-regularized sparse least-squares problems as the conditioning of the problem changes and the dimensions of the problem increase up to one trillion. A rigorously defined generator is presented which allows control of the dimensions, the conditioning and the sparsity of the problem. The generator has very low memory req...
متن کاملA $2\ell k$ Kernel for $\ell$-Component Order Connectivity
In the `-Component Order Connectivity problem (` ∈ N), we are given a graph G on n vertices, m edges and a non-negative integer k and asks whether there exists a set of vertices S ⊆ V (G) such that |S| ≤ k and the size of the largest connected component in G−S is at most `. In this paper, we give a kernel for `-Component Order Connectivity with at most 2`k vertices that takes nO(`) time for eve...
متن کاملIterative Reweighted Algorithms for Matrix Rank Minimization Iterative Reweighted Algorithms for Matrix Rank Minimization
The problem of minimizing the rank of a matrix subject to affine constraints has many applications in machine learning, and is known to be NP-hard. One of the tractable relaxations proposed for this problem is nuclear norm (or trace norm) minimization of the matrix, which is guaranteed to find the minimum rank matrix under suitable assumptions. In this paper, we propose a family of Iterative Re...
متن کاملIterative Reweighted Minimization Methods for $l_p$ Regularized Unconstrained Nonlinear Programming
In this paper we study general lp regularized unconstrained minimization problems. In particular, we derive lower bounds for nonzero entries of the firstand second-order stationary points and hence also of local minimizers of the lp minimization problems. We extend some existing iterative reweighted l1 (IRL1) and l2 (IRL2) minimization methods to solve these problems and propose new variants fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2018
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-017-9977-7