Global optimality condition and fixed point continuation algorithm for non-Lipschitz $\ell_p$ regularized matrix minimization (Q1650690): Difference between revisions

Latest revision as of 02:34, 16 July 2024

scientific article

Language	Label	Description	Also known as
English	Global optimality condition and fixed point continuation algorithm for non-Lipschitz $\ell_p$ regularized matrix minimization	scientific article

Statements

instance of

scholarly article

0 references

title

Global optimality condition and fixed point continuation algorithm for non-Lipschitz $\ell_p$ regularized matrix minimization (English)

0 references

0 references

0 references

0 references

Science China. Mathematics

0 references

publication date

5 July 2018

0 references

zbMATH Keywords

$\ell_p$ regularized matrix minimization

0 references

matrix completion problem

0 references

$p$-thresholding operator

0 references

global optimality condition

0 references

fixed point continuation algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11425-016-9107-y

0 references

cites work

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

A Singular Value Thresholding Algorithm for Matrix Completion

0 references

Exact matrix completion via convex optimization

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

Complexity of unconstrained $L_2 - L_p$ minimization

0 references

Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization

0 references

Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization

0 references

Global solutions of non-Lipschitz $S_{2}$-$S_{p}$ minimization over the positive semidefinite cone

0 references

Iteratively reweighted least squares minimization for sparse recovery

0 references

Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix

0 references

Least angle regression. (With discussion)

0 references

Sparsest solutions of underdetermined linear systems via $ \ell _q$-minimization for $0<q\leqslant 1$

0 references

Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence

0 references

Matrix Completion From a Few Entries

0 references

Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization

0 references

Interior-Point Method for Nuclear Norm Approximation with Application to System Identification

0 references

Iterative reweighted minimization methods for $l_p$ regularized unconstrained nonlinear programming

0 references

Penalty decomposition methods for rank minimization

0 references

$\ell _p$ regularized low-rank approximation via iterative reweighted singular value minimization

0 references

Fixed point and Bregman iterative methods for matrix rank minimization

0 references

Q5405230

0 references

Estimation of high-dimensional low-rank matrices

0 references

Recovery of sparsest signals via $\ell^q $-minimization

0 references

Q3161693

0 references

Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm

0 references

<formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm

0 references

Identifiers

zbMATH Open document ID

1391.90411

0 references

DOI

10.1007/s11425-016-9107-y

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1650690

@@ Property / cites work @@
+On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
+Normal rank
@@ Property / cites work @@
+Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
+Normal rank
@@ Property / cites work @@
+A Singular Value Thresholding Algorithm for Matrix Completion
+Normal rank
@@ Property / cites work @@
+Exact matrix completion via convex optimization
@@ Property / cites work: Exact matrix completion via convex optimization / rank @@
+Normal rank
@@ Property / cites work @@
+The Power of Convex Relaxation: Near-Optimal Matrix Completion
+Normal rank
@@ Property / cites work @@
+Complexity of unconstrained \(L_2 - L_p\) minimization
+Normal rank
@@ Property / cites work @@
+Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization
+Normal rank
@@ Property / cites work @@
+Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
+Normal rank
@@ Property / cites work @@
+Global solutions of non-Lipschitz \(S_{2}\)-\(S_{p}\) minimization over the positive semidefinite cone
+Normal rank
@@ Property / cites work @@
+Iteratively reweighted least squares minimization for sparse recovery
+Normal rank
@@ Property / cites work @@
+Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
+Normal rank
@@ Property / cites work @@
+Least angle regression. (With discussion)
@@ Property / cites work: Least angle regression. (With discussion) / rank @@
+Normal rank
@@ Property / cites work @@
+Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
+Normal rank
@@ Property / cites work @@
+Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
+Normal rank
@@ Property / cites work @@
+Matrix Completion From a Few Entries
@@ Property / cites work: Matrix Completion From a Few Entries / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
+Normal rank
@@ Property / cites work @@
+Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
+Normal rank
@@ Property / cites work @@
+Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
+Normal rank
@@ Property / cites work @@
+Penalty decomposition methods for rank minimization
+Normal rank
@@ Property / cites work @@
+\(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
+Normal rank
@@ Property / cites work @@
+Fixed point and Bregman iterative methods for matrix rank minimization
+Normal rank
@@ Property / cites work @@
+Q5405230
@@ Property / cites work: Q5405230 / rank @@
+Normal rank
@@ Property / cites work @@
+Estimation of high-dimensional low-rank matrices
@@ Property / cites work: Estimation of high-dimensional low-rank matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Recovery of sparsest signals via \(\ell^q \)-minimization
+Normal rank
@@ Property / cites work @@
+Q3161693
@@ Property / cites work: Q3161693 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
+Normal rank
@@ Property / cites work @@
+&lt;formula formulatype="inline"&gt;&lt;tex Notation="TeX"&gt;$L_{1/2}$&lt;/tex&gt; &lt;/formula&gt; Regularization: Convergence of Iterative Half Thresholding Algorithm
+Normal rank

Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization (Q1650690): Difference between revisions

Latest revision as of 02:34, 16 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)