Idioma:

A unified approach for minimizing composite norms

Aybat, N. S. ; Iyengar, G.

Mathematical programming, 2014-04, Vol.144 (1-2), p.181-226 [Periódico revisado por pares]

Berlin/Heidelberg: Springer Berlin Heidelberg

Texto completo disponível

Citações Citado por

Enviar para

Título:
A unified approach for minimizing composite norms
Autor: Aybat, N. S. ; Iyengar, G.
Assuntos: Algorithms ; Analysis ; Calculus of Variations and Optimal Control; Optimization ; Combinatorics ; Euclidean space ; Full Length Paper ; Lagrange multiplier ; Mathematical analysis ; Mathematical and Computational Physics ; Mathematical Methods in Physics ; Mathematical models ; Mathematical programming ; Mathematics ; Mathematics and Statistics ; Mathematics of Computing ; Minimization ; Norms ; Numerical Analysis ; Optimization ; Shrinkage ; Studies ; Theoretical ; Topological manifolds ; Vectors (mathematics)
É parte de: Mathematical programming, 2014-04, Vol.144 (1-2), p.181-226
Notas: ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
Descrição: We propose a first-order augmented Lagrangian algorithm (FALC) to solve the composite norm minimization problem where denotes the vector of singular values of , the matrix norm denotes either the Frobenius, the nuclear, or the -operator norm of , the vector norm denotes either the -norm, -norm or the -norm; is a closed convex set and , , are linear operators from to vector spaces of appropriate dimensions. Basis pursuit, matrix completion, robust principal component pursuit (PCP), and stable PCP problems are all special cases of the composite norm minimization problem. Thus, FALC is able to solve all these problems in a unified manner. We show that any limit point of FALC iterate sequence is an optimal solution of the composite norm minimization problem. We also show that for all , the FALC iterates are -feasible and -optimal after iterations, which require constrained shrinkage operations and Euclidean projection onto the set . Surprisingly, on the problem sets we tested, FALC required only constrained shrinkage, instead of the worst case bound, to compute an -feasible and -optimal solution. To best of our knowledge, FALC is the first algorithm with a known complexity bound that solves the stable PCP problem.
Editor: Berlin/Heidelberg: Springer Berlin Heidelberg
Idioma: Inglês

Voltar para lista de resultados

Realização: Logos de Redes Sociais:

A unified approach for minimizing composite norms

Aybat, N. S. ; Iyengar, G.

Berlin/Heidelberg: Springer Berlin Heidelberg

Buscando em bases de dados remotas. Favor aguardar.