monomialgeneration.m

来自「求解线性矩阵不等式简单方便--与LMI工具箱相比」· M 代码 · 共 29 行

function exponent_m = monomialgeneration(exponent_p,csclasses)
%MONOMIALGENERATION  Internal function to create candidate monomials in SOS programs

% Author Johan L鰂berg
% $Id: monomialgeneration.m,v 1.1 2006/03/30 13:56:54 joloef Exp $

exponent_m = [];
for i = 1:length(csclasses)
    if isempty(exponent_p)
        exponent_m{i,1} = zeros(1,0);
    else
        % Create initial set of monomials
        mindegrees = min(exponent_p(:,csclasses{i}));
        maxdegrees = max(exponent_p(:,csclasses{i}));
        if any(2*floor((maxdegrees/2))>maxdegrees)
            error('Highest degree in a variable is odd => not PSD')
        end

        % Make initial generation smarter...        
        exponent_m_temp1 = monolistcoeff(size(csclasses{i},2),ceil(maxdegrees/2),max(ceil(sum(exponent_p,2)/2)));

        [ii,jj] = sort(sum(exponent_m_temp1,2));
        exponent_m_temp1 = exponent_m_temp1(jj,:);
               
        exponent_m_temp2 = zeros(size(exponent_m_temp1,1),size(exponent_p,2));
        exponent_m_temp2(:,csclasses{i}) = exponent_m_temp1;
        exponent_m{i,1} = exponent_m_temp2;
    end
end