comparison examples/MajorizationMinimization tests/SMALL_AMT_DL_test_KSVD_MM.m @ 163:855025f4c779 ivand_dev

renaiming small_cgp to small_pcgp
author Ivan Damnjanovic lnx <ivan.damnjanovic@eecs.qmul.ac.uk>
date Wed, 07 Sep 2011 14:16:50 +0100
parents f42aa8bcb82f
children 9c418bea7f6a
comparison
equal deleted inserted replaced
161:f42aa8bcb82f 163:855025f4c779
87 SMALL.solver(1)=SMALL_init_solver; 87 SMALL.solver(1)=SMALL_init_solver;
88 88
89 % Defining the parameters needed for sparse representation 89 % Defining the parameters needed for sparse representation
90 90
91 SMALL.solver(1).toolbox='SMALL'; 91 SMALL.solver(1).toolbox='SMALL';
92 SMALL.solver(1).name='SMALL_cgp'; 92 SMALL.solver(1).name='SMALL_pcgp';
93 93
94 % Here we use mexLasso mode=2, with lambda=2, lambda2=0 and positivity 94 % Here we use mexLasso mode=2, with lambda=2, lambda2=0 and positivity
95 % constrain (type 'help mexLasso' for more information about modes): 95 % constrain (type 'help mexLasso' for more information about modes):
96 % 96 %
97 % min_{alpha_i} (1/2)||x_i-Dalpha_i||_2^2 + lambda||alpha_i||_1 + (1/2)lambda2||alpha_i||_2^2 97 % min_{alpha_i} (1/2)||x_i-Dalpha_i||_2^2 + lambda||alpha_i||_1 + (1/2)lambda2||alpha_i||_2^2