-
Notifications
You must be signed in to change notification settings - Fork 91
/
posttransfo.m
53 lines (51 loc) · 1.96 KB
/
posttransfo.m
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
function [x,y,K] = posttransfo(x,y,prep,K,~)
% [xp,yp] = posttransfo(x,y,prep,K)
%
% POSTTRANSFO Transforms (x,y) from internal SeDuMi format into original
% user format.
%
% ********** INTERNAL FUNCTION OF SEDUMI **********
%
% See also sedumi
% Nearly complete rewrite
% Copyright (c) 2013 Michael C. Grant
%
% This file is part of SeDuMi 1.1 by Imre Polik and Oleksandr Romanko
% Copyright (C) 2005 McMaster University, Hamilton, CANADA (since 1.1)
%
% Copyright (C) 2001 Jos F. Sturm (up to 1.05R5)
% Dept. Econometrics & O.R., Tilburg University, the Netherlands.
% Supported by the Netherlands Organization for Scientific Research (NWO).
%
% Affiliation SeDuMi 1.03 and 1.04Beta (2000):
% Dept. Quantitative Economics, Maastricht University, the Netherlands.
%
% Affiliations up to SeDuMi 1.02 (AUG1998):
% CRL, McMaster University, Canada.
% Supported by the Netherlands Organization for Scientific Research (NWO).
%
% This program is free software; you can redistribute it and/or modify
% it under the terms of the GNU General Public License as published by
% the Free Software Foundation; either version 2 of the License, or
% (at your option) any later version.
%
% This program is distributed in the hope that it will be useful,
% but WITHOUT ANY WARRANTY; without even the implied warranty of
% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
% GNU General Public License for more details.
%
% You should have received a copy of the GNU General Public License
% along with this program; if not, write to the Free Software
% Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
% 02110-1301, USA
% This routine is significantly simpler than before, because most of the
% heavy lifting has been accomplished by the QR matrix.
K.l = K.l - 1;
x = (x'*prep.QR)';
if ~isempty(K.ycomplex)
ylen = length(y) - length(K.ycomplex);
y = y(1:ylen) + 1j * sparse(K.ycomplex,1,y(ylen+1:length(y)),ylen,1);
end
if nnz(x) / numel(x) < 1/2
x = sparse(x);
end