plateform stringclasses 1
value | repo_name stringlengths 13 113 | name stringlengths 3 74 | ext stringclasses 1
value | path stringlengths 12 229 | size int64 23 843k | source_encoding stringclasses 9
values | md5 stringlengths 32 32 | text stringlengths 23 843k |
|---|---|---|---|---|---|---|---|---|
github | evanrussek/Predictive-Representations-PLOS-CB-2017-master | model_Vpunc.m | .m | Predictive-Representations-PLOS-CB-2017-master/agents/model_Vpunc.m | 1,399 | utf_8 | b18ff9dc9193e5204a26ccfa219f13ab | function model = model_Vpunc()
model.init = @modelinit;
model.update = @modelupdate;
model.eval = @modeleval;
model.choose = @modelchoose;
function model = modelinit(model,game, params_in)
if nargin < 3
% parameters
model.param.epsilon = .1;
model.param.alpha = .25;
model.param.discount = .9;
else
mo... |
github | evanrussek/Predictive-Representations-PLOS-CB-2017-master | makegame2.m | .m | Predictive-Representations-PLOS-CB-2017-master/environment functions/makegame2.m | 4,424 | utf_8 | d7cabf9bf1513b3286d220f86592671f | function game = makegame2(locations,magnitude,wallloc, startpos)
% setupmo
rows = 10;
cols = 10;
nstates = rows*cols;
nactions = 4;
if nargin < 4
startpos = [8 1];
end
% map y,x positions to number
global yx_to_state
yx_to_state_t = zeros(cols,rows);
for c = 1:cols
yx_to_state_t(c,:) = 1 + (c-1)*rows : rows*c;
end... |
github | proteekroy/U-NSGA-III-master | nsga2_selection.m | .m | U-NSGA-III-master/nsga2_selection.m | 3,756 | utf_8 | fe4f9081b3ddc830d7d2ef6508f14ffb |
% Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law ... |
github | proteekroy/U-NSGA-III-master | nsga2_basic_parameters.m | .m | U-NSGA-III-master/nsga2_basic_parameters.m | 10,188 | utf_8 | a19d12c82ef480ac57e50f22f45f4857 | % Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law or... |
github | proteekroy/U-NSGA-III-master | lhsamp_model.m | .m | U-NSGA-III-master/lhsamp_model.m | 684 | utf_8 | b7f69e0e86d4ff88a19e401b51ad4f45 | %LHSAMP Latin hypercube distributed random numbers
%
% Call: S = lhsamp
% S = lhsamp(m)
% S = lhsamp(m, n)
%
% m : number of sample points to generate, if unspecified m = 1
% n : number of dimensions, if unspecified n = m
%
% S : the generated n dimensional m sample points chosen from
% unifor... |
github | proteekroy/U-NSGA-III-master | initweight.m | .m | U-NSGA-III-master/initweight.m | 1,058 | utf_8 | 9514a2706de36304cb8ac18d16ab8e55 | % This function is written by Dr. Aimin Zhou for generating any number of weight vectors
function W = initweight(objDim, N)
U = floor(N^(1/(objDim-1)))-2;
M = 0;
while M<N
U = U+1;
M = noweight(U, 0, objDim);
end
W = zeros(objDim, M);
C = 0;
V = zeros(o... |
github | proteekroy/U-NSGA-III-master | pol_mut.m | .m | U-NSGA-III-master/pol_mut.m | 1,724 | utf_8 | f9fb82822294f15a5f9400264f983295 | % Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law or agreed ... |
github | proteekroy/U-NSGA-III-master | calculate_feasible_paretofront.m | .m | U-NSGA-III-master/calculate_feasible_paretofront.m | 1,223 | utf_8 | 82de86fb954b015d2d4683c41d21144e |
% Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law ... |
github | proteekroy/U-NSGA-III-master | nsga2_main.m | .m | U-NSGA-III-master/nsga2_main.m | 3,778 | utf_8 | 414dd86ff659dd183e990134d31cb0ad | % Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law or... |
github | proteekroy/U-NSGA-III-master | crossover.m | .m | U-NSGA-III-master/crossover.m | 1,060 | utf_8 | 9fd9fdc06007fb5334b3806be4488984 |
% Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law ... |
github | proteekroy/U-NSGA-III-master | sbx.m | .m | U-NSGA-III-master/sbx.m | 3,387 | utf_8 | 8016f8a750f4d50f32052960259732d9 |
% Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law or agreed... |
github | proteekroy/U-NSGA-III-master | mutation.m | .m | U-NSGA-III-master/mutation.m | 1,043 | utf_8 | e894e51e73b91d9dae7c485dc2ebef95 |
% Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable la... |
github | proteekroy/U-NSGA-III-master | evaluate_pop.m | .m | U-NSGA-III-master/evaluate_pop.m | 1,248 | utf_8 | 4afe8b4282b9d56b9d1d8076c925da1f | % Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law or... |
github | proteekroy/U-NSGA-III-master | plot_population.m | .m | U-NSGA-III-master/plot_population.m | 1,196 | utf_8 | 0e33d1ac9e0b53bd0f7ad8f3a5ed6700 | % Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law or... |
github | proteekroy/U-NSGA-III-master | constrained_tournament_selection.m | .m | U-NSGA-III-master/constrained_tournament_selection.m | 3,148 | utf_8 | 4432c055ad3ad0ec66c819e1963c8ee4 | % Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law or... |
github | proteekroy/U-NSGA-III-master | bos.m | .m | U-NSGA-III-master/bos.m | 3,896 | utf_8 | 09bb3c8d6145d4e68512b7d21eea72b4 | % Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law or... |
github | proteekroy/U-NSGA-III-master | survival_selection.m | .m | U-NSGA-III-master/survival_selection.m | 1,103 | utf_8 | b2bd1a5c58c1263c4a65376474f0107f | % Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law or... |
github | proteekroy/U-NSGA-III-master | crowdingDistance.m | .m | U-NSGA-III-master/crowdingDistance.m | 1,529 | utf_8 | d5106f814202596463a1dd74f6fb2050 | % Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law or... |
github | proteekroy/U-NSGA-III-master | lex_dominate.m | .m | U-NSGA-III-master/lex_dominate.m | 1,117 | utf_8 | 0ba44dfca024e0f3638f1de3cd8ae8d9 | % Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law or... |
github | proteekroy/U-NSGA-III-master | main.m | .m | U-NSGA-III-master/main.m | 4,137 | utf_8 | d9abd04e8d176117a44808f970124307 |
% Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law ... |
github | proteekroy/U-NSGA-III-master | evaluateCV.m | .m | U-NSGA-III-master/evaluateCV.m | 964 | utf_8 | aba733d42645f2a8e801d363d3ce42e7 | % Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law or... |
github | proteekroy/U-NSGA-III-master | mating_selection.m | .m | U-NSGA-III-master/mating_selection.m | 1,062 | utf_8 | 9656a0552b11d50596840660516c1ffe |
% Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law ... |
github | proteekroy/U-NSGA-III-master | niching_based_tournament_selection.m | .m | U-NSGA-III-master/niching_based_tournament_selection.m | 3,260 | utf_8 | 96a57b89444c96de933fc0d85a2f884f | % Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law or... |
github | proteekroy/U-NSGA-III-master | high_fidelity_evaluation.m | .m | U-NSGA-III-master/high_fidelity_evaluation.m | 14,903 | utf_8 | d1a6cd89d5aad2c6b492dc30ae0ac295 | % Copyright [2017] [Proteek Chandan Roy]
%
% Licensed under the Apache License, Version 2.0 (the "License");
% you may not use this file except in compliance with the License.
% You may obtain a copy of the License at
%
% http://www.apache.org/licenses/LICENSE-2.0
%
% Unless required by applicable law or... |
github | mehr-een/bemkl-rbps-master | civalue.m | .m | bemkl-rbps-master/BEMKL/civalue.m | 698 | utf_8 | 0948ed66c5f328a35546256d21c9b141 | %Mehreen Ali
%mehreen.ali@helsinki.fi
function CIndex2 = civalue(y,yhat)
ci = zeros(1,size(y,2));
for k= 1:size(y,2) % col
s = 0; % score sum
n = 0; % eligible pair of scores
for i= 1:size(y,1) % row
for j= i+1:size(y,1) % next row
if (i < j)
if(y(i,k) > y(j,k))
... |
github | mehr-een/bemkl-rbps-master | bemkl_loocv.m | .m | bemkl-rbps-master/BEMKL/bemkl_loocv.m | 5,706 | utf_8 | 04d503f48a3052ac41dba55272940d1c | %Mehreen Ali
%mehreen.ali@helsinki.fi
function [validation_response_CV,predicted_response_CV] = bemkl_loocv(drug_source, view_index)
load 'DataViews.mat';
load 'ViewCombinations.mat'; % combos with mut_data
%%%% selected views
view_names = view_combinations{view_index,1};
view_kernels = view_com... |
github | yanlirock/Multi-task_Survival_Analysis-master | example_cox_CMTL.m | .m | Multi-task_Survival_Analysis-master/example_cox_CMTL.m | 1,706 | utf_8 | e4b3f847365c131b1c42bf66d36edfcd | %% file example_cox_CMTL.m
% this file shows the usage of cox_CMTL.m function
function example_cox_CMTL(floder, name_train,name_test,lam_iter,clus_num,Smallest_lambda_rate)
current_path=cd;
Num_lambda=str2num(lam_iter);
smallest_rate=str2double(Smallest_lambda_rate);
addpath(genpath([current_path '/functions/']... |
github | yanlirock/Multi-task_Survival_Analysis-master | multi_cox_prepare.m | .m | Multi-task_Survival_Analysis-master/multi_cox_prepare.m | 4,835 | utf_8 | 0fea2f9f280db4dc0227666bfb531de5 | % This function is used to prapare the training and testing file for
% multi_task survival analysis. Beside cross validation it will also
% do preprocess for Cox model
function multi_cox_prepare(folder, num_cv)
% Detailed explanation goes here
%clear all;
n_num_cv=str2double(num_cv);
current_path=cd;
... |
github | yanlirock/Multi-task_Survival_Analysis-master | cox_L21.m | .m | Multi-task_Survival_Analysis-master/functions/cox_L21.m | 5,214 | utf_8 | 8688603ca548670a84a88f53d5e9e42a | %% FUNCTION Logistic_TGL
% L21 Joint Feature Learning with Coxph Loss.
%% Code starts here
function [W, funcVal] = cox_L21(cox_processed, W0, rho1, opts)
if nargin <3
error('\n Inputs: cox_processed, W0, rho1, should be specified!\n');
end
if nargin <4
opts = [];
end
% initialize options.
%o... |
github | yanlirock/Multi-task_Survival_Analysis-master | Cox_Trace.m | .m | Multi-task_Survival_Analysis-master/functions/Cox_Trace.m | 4,053 | utf_8 | 63bc478fd7d3d32581dc386a1606cc38 | %% FUNCTION Least_Trace
% Trace-Norm Regularized Learning with Cox Loss.
%% Code starts here
function [W, funcVal] = Cox_Trace(cox_processed, W0, rho1, opts)
if nargin <3
error('\n Inputs: cox_processed, W0, rho1, should be specified!\n');
end
if nargin <4
opts = [];
end
% initialize options.
%opts=init_... |
github | yanlirock/Multi-task_Survival_Analysis-master | cox_CMTL.m | .m | Multi-task_Survival_Analysis-master/functions/cox_CMTL.m | 6,675 | utf_8 | bdabaa2c5864cee534765bccb59aa949 | %% FUNCTION cox_CMTL
% Convex-relaxed Clustered Multi-Task Learning with Cox prprotional Loss.
%% Code starts here
function [W, funcVal,funcVal_cox, M] = cox_CMTL(cox_processed,rho1, rho2, k, W_old, opts)
if nargin <4
error('\n Inputs: cox_processed,rho1, rho2,and k should be specified!\n');
end
if nar... |
github | yanlirock/Multi-task_Survival_Analysis-master | trace_projection.m | .m | Multi-task_Survival_Analysis-master/functions/trace_projection.m | 845 | utf_8 | dd710458fa390abd7ddc25e47f8af341 | %% FUNCTION trace_projection
% solves the Trace-norm projection problem.
%
%% OBJECTIVE
% argmin_X = 0.5 \|X - L\| + alpha/2 \|L\|
%
%
%% RELATED PAPERS
% [1] Cai et. al. A Singlar Value Thresholding Algorihtm for Matrix
% Completion.
function [L_hat L_tn] = trace_projection(L, alpha)
[d1 d2]... |
github | yanlirock/Multi-task_Survival_Analysis-master | bsa_ihb.m | .m | Multi-task_Survival_Analysis-master/functions/bsa_ihb.m | 1,215 | utf_8 | 4fd0ebe89b57d6e51011d127f2f7b379 | %% FUNCTION bsa_ihb
% Singular Projection
%
%% OBJECTIVE
% min 1/2*||x - a||_2^2
% s.t. b'*x = r, 0<= x <= u, b > 0
%
%
%% Related papers
%
% [1] KC. Kiwiel. On linear-time algorithms for the continuous
% quadratic knapsack problem, Journal of Optimization Theory
% and Applications, 2007... |
github | nappoo/contourlet-transform-master | wfb2rec.m | .m | contourlet-transform-master/wfb2rec.m | 1,419 | utf_8 | a8eb98892d022925b472758e34d4640d | function x = wfb2rec(x_LL, x_LH, x_HL, x_HH, h, g)
% WFB2REC 2-D Wavelet Filter Bank Decomposition
%
% x = wfb2rec(x_LL, x_LH, x_HL, x_HH, h, g)
%
% Input:
% x_LL, x_LH, x_HL, x_HH: Four 2-D wavelet subbands
% h, g: lowpass analysis and synthesis wavelet filters
%
% Output:
% x: reconst... |
github | nappoo/contourlet-transform-master | wfb2dec.m | .m | contourlet-transform-master/wfb2dec.m | 1,359 | utf_8 | cf0a7abcc9abae631039550460b07a48 | function [x_LL, x_LH, x_HL, x_HH] = wfb2dec(x, h, g)
% WFB2DEC 2-D Wavelet Filter Bank Decomposition
%
% y = wfb2dec(x, h, g)
%
% Input:
% x: input image
% h, g: lowpass analysis and synthesis wavelet filters
%
% Output:
% x_LL, x_LH, x_HL, x_HH: Four 2-D wavelet subbands
% Make sure... |
github | nappoo/contourlet-transform-master | extend2.m | .m | contourlet-transform-master/extend2.m | 1,861 | utf_8 | 40bc6d67909280efd214bb2536a4a46f | function y = extend2(x, ru, rd, cl, cr, extmod)
% EXTEND2 2D extension
%
% y = extend2(x, ru, rd, cl, cr, extmod)
%
% Input:
% x: input image
% ru, rd: amount of extension, up and down, for rows
% cl, cr: amount of extension, left and rigth, for column
% extmod: extension mode. The valid modes are:
% 'per... |
github | spin0za/shadow-boundary-detection-master | buildFeatures.m | .m | shadow-boundary-detection-master/buildFeatures.m | 3,852 | utf_8 | 5104f9ea0ac10958a30e9938119e2117 | % Calculating features for all edge (candidate) pixels
function features = buildFeatures(img, edgePixels, featNum)
dim = 36;
features = zeros(featNum, dim);
% gradient threshold to determine edge width
thresh = 0.1;
% compute 1st feature: Gaussian filter size = 2*support+1
sigma = 1;
support = 2;
sizeFilter = 2*suppor... |
github | fstasel/fastBilateral3d-master | bf3.m | .m | fastBilateral3d-master/bf3.m | 2,726 | utf_8 | d1c304ecce7898e6b3ba7e3eddbb0401 | % Fast 3d bilateral filter for unit8 images
% Coded by FST
%
% F. Porikli, “Constant time O (1) bilateral filtering,” Comput. Vis.
% Pattern Recognition, 2008. CVPR 2008. IEEE Conf., no. 1, pp. 1–8, 2008.
%
% Usage:
% Ibf = bf3(I, spatialSize, rangeSigma)
%
% I: input 3d image
%
% spatialSize: window size of s... |
github | LLNL/psuade-master | lbfgsb.m | .m | psuade-master/External/L-BFGS-B-C/Matlab/lbfgsb.m | 10,264 | utf_8 | cf0b737b65f70954855560be1aae6caf | function [x,f,info] = lbfgsb( fcn, l, u, opts )
% x = lbfgsb( fcn, l, u )
% uses the lbfgsb v.3.0 library (fortran files must be installed;
% see compile_mex.m ) which is the L-BFGS-B algorithm.
% The algorithm is similar to the L-BFGS quasi-Newton algorithm,
% but also handles bound constraints via an acti... |
github | anantsrivastava30/SUVR-PET-ADNI-master | cvx_version.m | .m | SUVR-PET-ADNI-master/scripts/cvx/cvx_version.m | 14,459 | utf_8 | 9f358480cc5d66caa274c9d5bd5ed0de | function varargout = cvx_version( varargin )
% CVX_VERSION Returns version and environment information for CVX.
%
% When called with no arguments, CVX_VERSION prints out version and
% platform information that is needed when submitting CVX bug reports.
%
% This function is also used internally to return use... |
github | anantsrivastava30/SUVR-PET-ADNI-master | cvx_grbgetkey.m | .m | SUVR-PET-ADNI-master/scripts/cvx/cvx_grbgetkey.m | 19,096 | utf_8 | 080162e4fd27b14ea8387362148db7d1 | function success = cvx_grbgetkey( kcode, overwrite )
% CVX_GRBGETKEY Retrieves and saves a Gurobi/CVX license.
%
% This function is used to install Gurobi license keys for use in CVX. It
% is called with your Gurobi license code as a string argument; e.g.
%
% cvx_grbgetkey xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx
% ... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HSDNTcorr.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/HSDSolver/HSDNTcorr.m | 1,001 | utf_8 | c42eba1c6bae660b88921b7c8747490e | %%************************************************************************
%% HSDNTcorr: corrector step for the NT direction.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%************************************************************************
f... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HSDHKMdirfun.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/HSDSolver/HSDHKMdirfun.m | 1,551 | utf_8 | 1034e25e48a42d2fa143f93f47961fe9 | %%*******************************************************************
%% HSDHKMdirfun: compute (dX,dZ), given dy, for the HKM direction.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%****************************************************************... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HSDsqlp.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/HSDSolver/HSDsqlp.m | 11,860 | utf_8 | 00b8311a8efbee36662ca9288870a1cd | %%*****************************************************************************
%% HSDsqlp: solve an semidefinite-quadratic-linear program
%% by infeasible path-following method on the homogeneous self-dual model.
%%
%% [obj,X,y,Z,info,runhist] =
%% HSDsqlp(blk,At,C,b,OPTIONS,X0,y0,Z0);
%%
%% Input: blk: a cel... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HSDsortA.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/HSDSolver/HSDsortA.m | 2,577 | utf_8 | 0a74ddbb8a0c79bf22592d780d865e06 | %%*********************************************************************
%% sortA: sort columns of At{p} in ascending order according to the
%% number of nonzero elements.
%%
%% [At,C,b,X0,Z0,permA,permZ] = sortA(blk,At,C,b,X0,Z0);
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tut... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HSDHKMrhsfun.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/HSDSolver/HSDHKMrhsfun.m | 2,666 | utf_8 | 16409ae4672f80ef54a33c31ef30000f | %%*******************************************************************
%% HSDHKMrhsfun: compute the right-hand side vector of the
%% Schur complement equation for the HKM direction.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%*****... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HSDsqlpcheckconvg.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/HSDSolver/HSDsqlpcheckconvg.m | 6,249 | utf_8 | a579e4972fd77d5cc3e11b72bf56d3a9 | %%*****************************************************************************
%% HSDsqlpcheckconvg: check convergence.
%%
%% ZpATynorm, AX, normX, normZ are with respect to the
%% original variables, not the HSD variables.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last ... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HSDNTdirfun.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/HSDSolver/HSDNTdirfun.m | 1,459 | utf_8 | a045827a3ca1adcf8806cfd8234ad5e4 | %%*******************************************************************
%% HSDNTdirfun: compute (dX,dZ), given dy, for the NT direction.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%******************************************************************... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HSDNTrhsfun.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/HSDSolver/HSDNTrhsfun.m | 3,424 | utf_8 | 02348c55d691a53b023639b8103757be | %%*******************************************************************
%% HSDNTrhsfun: compute the right-hand side vector of the
%% Schur complement equation for the NT direction.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%*********... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HSDHKMpred.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/HSDSolver/HSDHKMpred.m | 2,644 | utf_8 | 81b89c36e0d0bad30836c551264a6a05 | %%*******************************************************************
%% HSDHKMpred: Compute (dX,dy,dZ) for the H..K..M direction.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%*******************************************************************
f... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HSDsqlpmain.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/HSDSolver/HSDsqlpmain.m | 28,301 | utf_8 | df880652075e1e6d94eefd6ddfe38c64 | %%*****************************************************************************
%% HSDsqlp: solve an semidefinite-quadratic-linear program
%% by infeasible path-following method on the homogeneous self-dual model.
%%
%% [obj,X,y,Z,info,runhist] =
%% HSDsqlp(blk,At,C,b,OPTIONS,X0,y0,Z0,kap0,tau0,theta0);
%%
%% ... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HSDlinsysolve.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/HSDSolver/HSDlinsysolve.m | 6,495 | utf_8 | 0644ae75443d221edcf585f5a5736fe5 | %%***************************************************************
%% linsysolve: solve linear system to get dy, and direction
%% corresponding to unrestricted variables.
%%
%% [xx,coeff,L,resnrm] = linsysolve(schur,UU,EE,Bmat,rhs);
%%
%% child functions: mybicgstable.m
%%
%% SDPT3: version 3.1
%% Copyright ... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HSDsqlpmisc.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/HSDSolver/HSDsqlpmisc.m | 3,299 | utf_8 | f36316ddff8099a74241fa1590fc584a | %%*****************************************************************************
%% HSDsqlpmisc:
%% produce infeasibility certificates if appropriate
%%
%% Input: X,y,Z are the original variables, not the HSD variables.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modifi... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HSDbicgstab.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/HSDSolver/HSDbicgstab.m | 3,084 | utf_8 | 96ee9f939e0b2527113539aa0b633ffc | %%*************************************************************************
%% HSDbicgstab
%%
%% [xx,resnrm,flag] = HSDbicgstab(A,b,M1,tol,maxit)
%%
%% iterate on bb - (M1)*AA*x
%%
%% r = b-A*xtrue;
%%
%%*************************************************************************
function [xx,resnrm,flag] = HSDbicgstab(... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HSDHKMcorr.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/HSDSolver/HSDHKMcorr.m | 985 | utf_8 | 1e1983a66956f1d3e4e8e279b1dbe2d0 | %%*****************************************************************
%% HSDHKMcorr: corrector step for the HKM direction.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%*****************************************************************
function [par... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HSDNTpred.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/HSDSolver/HSDNTpred.m | 2,034 | utf_8 | e194daf53d375b24154b1caf94b7646d | %%**********************************************************************
%% HSDNTpred: Compute (dX,dy,dZ) for NT direction.
%%
%% compute SVD of Xchol*Zchol via eigenvalue decompostion of
%% Zchol * X * Zchol' = V * diag(sv2) * V'.
%% compute W satisfying W*Z*W = X.
%% W = G'*G, where G = diag(sqrt(sv)) * (inv... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HSDsqlpCpert.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/HSDSolver/HSDsqlpCpert.m | 2,263 | utf_8 | 326ec0065ebb155fab5ee8b4670ec0db | %%*****************************************************************************
%% HSDsqlpCpert: perturb C.
%%
%%*****************************************************************************
function [At,Cpert] = HSDsqlpCpert(blk,At,par,C,X,Cpert,runhist)
iter = length(runhist.pinfeas);
prim_infeas = runhist.pinfeas(... |
github | anantsrivastava30/SUVR-PET-ADNI-master | cheby0.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Examples/cheby0.m | 2,576 | utf_8 | a31e95ee5e80694cd1c3f2ceb594d369 | %%**********************************************************
%% cheby0:
%%
%% minimize || p(d) ||_infty
%% p = polynomial of degree <= m such that p(0) = 1.
%%
%% Here d = n-vector
%%----------------------------------------------------------
%% [blk,Avec,C,b,X0,y0,Z0,objval,p] = cheby0(d,m,solve);
%%
%% d ... |
github | anantsrivastava30/SUVR-PET-ADNI-master | randmat.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/randmat.m | 782 | utf_8 | 44e2c609bf458ffd5a37d9f816a0ea1b | %%******************************************************
%% randmat: generate an mxn matrix using matlab's
%% rand or randn functions using state = k.
%%
%%******************************************************
function v = randmat(m,n,k,randtype)
try
s = rng;
rng(k);
if strcmp(randtype,'n')
... |
github | anantsrivastava30/SUVR-PET-ADNI-master | skron.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/skron.m | 1,389 | utf_8 | 3aba6bed9dc50b45f766b4a8620c4ac3 | %%***********************************************************************
%% skron: Find the matrix presentation of
%% symmetric kronecker product skron(A,B), where
%% A,B are symmetric.
%%
%% Important: A,B are assumed to be symmetric.
%%
%% K = skron(blk,A,B);
%%
%% blk: a cell array specifying the b... |
github | anantsrivastava30/SUVR-PET-ADNI-master | NTcorr.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/NTcorr.m | 1,315 | utf_8 | 458c52ec6bf00d3507df137889a53c7e | %%************************************************************************
%% NTcorr: corrector step for the NT direction.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%************************************************************************
func... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HKMcorr.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/HKMcorr.m | 1,313 | utf_8 | ff69a87fe927bf7f964fd55cbf7ec718 | %%*****************************************************************
%% HKMcorr: corrector step for the HKM direction.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%*****************************************************************
function [dX,dy,... |
github | anantsrivastava30/SUVR-PET-ADNI-master | steplength.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/steplength.m | 5,590 | utf_8 | 2b52f7d5b9712cf17885f9ca3eaeb666 | %%***************************************************************************
%% steplength: compute xstep such that X + xstep*dX >= 0.
%%
%% [xstep] = steplength(blk,X,dX,Xchol,invXchol);
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%***********... |
github | anantsrivastava30/SUVR-PET-ADNI-master | SDPT3data_SEDUMIdata.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/SDPT3data_SEDUMIdata.m | 3,843 | utf_8 | 26106829dfa4c0fbb1ca8c4aa9839fa8 | %%**********************************************************
%% SDPT3data_SEDUMIdata: convert SQLP data in SDPT3 format to
%% SeDuMi format
%%
%% [At,b,c,K] = SDPT3data_SEDUMIdata(blk,AAt,CC,bb);
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modifie... |
github | anantsrivastava30/SUVR-PET-ADNI-master | schurmat_sblk.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/schurmat_sblk.m | 4,549 | utf_8 | f992891144a934ab4edffde2a692e435 | %%*******************************************************************
%% schurmat_sblk: compute Schur complement matrix corresponding to
%% SDP blocks.
%%
%% symm = 0, HKM
%% = 1, NT
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
... |
github | anantsrivastava30/SUVR-PET-ADNI-master | blktrace.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/blktrace.m | 2,084 | utf_8 | 6a5c3d9ff74073a8e864c246727eaa86 | %%**********************************************************************
%% blktrace: compute <X1,Z1> + ... + <Xp,Zp>
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%**********************************************************************
function tr... |
github | anantsrivastava30/SUVR-PET-ADNI-master | sqlpu2lblk.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/sqlpu2lblk.m | 3,099 | utf_8 | 1a67e45c349d19614e890521aed11db5 | %%***************************************************************************
%% sqlpu2lblk: decide whether to convert ublk to lblk
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 10 Jul 2007
%%*********************************************************************... |
github | anantsrivastava30/SUVR-PET-ADNI-master | Prod3.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/Prod3.m | 1,677 | utf_8 | 2ee9f0d732e5ea1f326bfcf275b0da3c | %%************************************************************
%% Prod3: compute the entries of Q = A*B*C specified in
%% nzlistQ.
%%
%% Q = Prod3(blk,A,B,C,sym,nzlistQ)
%% Important: (a) A is assumed to be symmetric if nzlistQ
%% has 2 columns (since mexProd2nz computes A'*B).
%% (b) T... |
github | anantsrivastava30/SUVR-PET-ADNI-master | sqlptermcode.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/sqlptermcode.m | 1,230 | utf_8 | 40b494719c3c614b6196dd9846778c4c | %%*************************************************************************
%% sqlptermcode.m: explains the termination code in sqlp.m
%%
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%***************************************************************... |
github | anantsrivastava30/SUVR-PET-ADNI-master | AXfun.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/AXfun.m | 1,869 | utf_8 | e816cba65d629a72167375f9a7697b2f | %%*************************************************************************
%% AXfun: compute AX(k) = <Ak,X>, k = 1:m
%%
%% AX = AXfun(blk,At,permA,X);
%%
%% Note: permA may be set to [] if no permutation is neccessary.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Mod... |
github | anantsrivastava30/SUVR-PET-ADNI-master | NTpred.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/NTpred.m | 1,963 | utf_8 | 3a2374e8ffa4806b637e50e551b9c17c | %%**********************************************************************
%% NTpred: Compute (dX,dy,dZ) for NT direction.
%%
%% compute SVD of Xchol*Zchol via eigenvalue decompostion of
%% Zchol * X * Zchol' = V * diag(sv2) * V'.
%% compute W satisfying W*Z*W = X.
%% W = G'*G, where G = diag(sqrt(sv)) * (invZch... |
github | anantsrivastava30/SUVR-PET-ADNI-master | sqlp.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/sqlp.m | 11,506 | utf_8 | d4acdbc7a5a1c0fd270f5d3de302c545 | %%*****************************************************************************
%% sqlp: solve an semidefinite-quadratic-linear program
%% by infeasible path-following method.
%%
%% [obj,X,y,Z,info,runhist] = sqlp(blk,At,C,b,OPTIONS,X0,y0,Z0);
%%
%% Input: blk: a cell array describing the block diagonal structu... |
github | anantsrivastava30/SUVR-PET-ADNI-master | infeaspt.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/infeaspt.m | 5,422 | utf_8 | ed7ce61d1094307a576ad8ddfd42bd30 | %%********************************************************************
%% infeaspt: generate an initial point for sdp.m
%%
%% [X0,y0,Z0] = infeaspt(blk,At,C,b,options,scalefac);
%%
%% options = 1 if want X0,Z0 to be scaled identity matrices
%% = 2 if want X0,Z0 to be scalefac*(identity matrices).
%%
%% SDP... |
github | anantsrivastava30/SUVR-PET-ADNI-master | Arrow.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/Arrow.m | 933 | utf_8 | 4a1803a8a960eba5462879d0ae4cbb78 | %%********************************************************
%% Arrow:
%%
%% Fx = Arrow(pblk,f,x,options);
%%
%% if options == 0;
%% Fx = Arr(F)*x
%% if options == 1;
%% Fx = Arr(F)^{-1}*x
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%********... |
github | anantsrivastava30/SUVR-PET-ADNI-master | mybicgstab.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/mybicgstab.m | 3,536 | utf_8 | 7ae20f5d14c6533fd9a50b23a1e5c8b3 | %%*************************************************************************
%% mybicgstab
%%
%% [xx,resnrm,flag] = mybicgstab(A,b,M1,tol,maxit)
%%
%% iterate on bb - (M1)*AA*x
%%
%% r = b-A*xtrue;
%%
%%*************************************************************************
function [xx,resnrm,flag] = mybicgstab(A,b... |
github | anantsrivastava30/SUVR-PET-ADNI-master | degeneracy.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/degeneracy.m | 5,175 | utf_8 | 52287ec83b17f60c33554d7a25764672 | %%***************************************************************
%% degeneracy: determine if an SDP problem is non-degenerate.
%%
%% [ddx,ddz,B1,B2,sig1,sig12] = degeneracy(blk,At,X,y,Z);
%%
%% Assume that strict complementarity holds:
%% for primal non-degeneracy, we need rank([B1 B2]) = m
%% for dual non-degeneracy,... |
github | anantsrivastava30/SUVR-PET-ADNI-master | mytime.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/mytime.m | 557 | utf_8 | 2d076b8ed1091521bbe986194c6e2b84 | %%*********************************************
%% mytime:
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%*********************************************
function [hh,mm,ss] = mytime(t)
t = round(t);
h = floor(t/3600);
m = floor(rem(t,3600)/60);
s ... |
github | anantsrivastava30/SUVR-PET-ADNI-master | validate.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/validate.m | 7,427 | utf_8 | 60774ce6b3bd16bde97e4078d89db39b | %%***********************************************************************
%% validate: validate data
%%
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%***********************************************************************
function [blk,At,C,b,di... |
github | anantsrivastava30/SUVR-PET-ADNI-master | svec.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/svec.m | 2,027 | utf_8 | 43bbe7c274d2d1bfb1014fc2000f47e3 | %*********************************************************
%% svec: compute the vector svec(M),
%%
%% x = svec(blk,M,isspx);
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%**********************************************************
function x = s... |
github | anantsrivastava30/SUVR-PET-ADNI-master | read_sedumi.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/read_sedumi.m | 7,265 | utf_8 | 2035885c053fc9de89cf19fa667603d2 | %%*******************************************************************
%% Read in a problem in SeDuMi format.
%%
%% [blk,A,C,b,perm] = read_sedumi(fname,b,c,K)
%%
%% Input: fname.mat = name of the file containing SDP data in
%% SeDuMi format.
%%
%% Important note: Sedumi's notation for free variab... |
github | anantsrivastava30/SUVR-PET-ADNI-master | qprod.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/qprod.m | 655 | utf_8 | 2d6550b139b2dfcf3d134f61deec3686 | %%***************************************************
%% qprod:
%%
%% Input: A = [A1 A2 ... An]
%% x = [x1; x2; ...; xn]
%% Output: [A1*x1 A2*x2 ... An*xn]
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%**************************************... |
github | anantsrivastava30/SUVR-PET-ADNI-master | nzlist.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/nzlist.m | 5,014 | utf_8 | 1225b63fe9e00df09546243f60599dc2 | %%***********************************************************************
%% nzlist: find the combined list of non-zero elements
%% of Aj, j = 1:k, for each k,
%% assuming that the Aj's are permuted such that
%% A1 has the fewest nonzero elements, followed by A2, and so on.
%%
%% [isspA,nzlistA,... |
github | anantsrivastava30/SUVR-PET-ADNI-master | detect_lblk.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/detect_lblk.m | 4,228 | utf_8 | a69e3486a171d0169d9b62b749ed6cd8 | %%*******************************************************************
%% detect_lblk: detect diagonal blocks in the SDP data.
%%
%% [blk,At,C,diagblkinfo,blockchange,parbarrier,X,Z] = ...
%% detect_lblk(blk,At,C,b,parbarrier,X,Z);
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. ... |
github | anantsrivastava30/SUVR-PET-ADNI-master | gdcomp.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/gdcomp.m | 4,877 | utf_8 | edb240000afc00b0bd8d14fdc4ab944c | %%*********************************************************************
%% gdcomp: Compute gd = 1/td in Equation (15) of the paper:
%%
%% R.M. Freund, F. Ordonez, and K.C. Toh,
%% Behavioral measures and their correlation with IPM iteration counts
%% on semi-definite programming problems,
%% Mathematical Programming, 1... |
github | anantsrivastava30/SUVR-PET-ADNI-master | blkbarrier.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/blkbarrier.m | 1,795 | utf_8 | 77a6eb1f1708aa69217000d27735efa0 | %%********************************************************************
%% blkbarrier: calculate
%% [-v(p)*logdet(X{p}), v(p)*logdet(Z{p}) + n*v(p)*(1-log(v(p)))]
%% [-v(p)*log(gam(X{p})), v(p)*log(gam(Z{p})) + v(p)]
%% [-v(p)*log(X{p}), v(p)*log(Z{p}) + n*v(p)*(1-log(v(p)))]
%%***********************************... |
github | anantsrivastava30/SUVR-PET-ADNI-master | sqlpmain.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/sqlpmain.m | 29,812 | utf_8 | 97c549fe923480dc73e59887089d5656 | %%*************************************************************************
%% sqlp: main solver
%%
%%*************************************************************************
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%****************************... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HKMpred.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/HKMpred.m | 2,818 | utf_8 | da0e8d9efacd9a7cebaae5ea2ad63de9 | %%*******************************************************************
%% HKMpred: Compute (dX,dy,dZ) for the H..K..M direction.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%*******************************************************************
func... |
github | anantsrivastava30/SUVR-PET-ADNI-master | read_sdpa.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/read_sdpa.m | 7,591 | utf_8 | 211ea10474df1ffe50a0c5456e1cbe41 | %%*******************************************************************
%% Read in a problem in SDPA sparse format.
%%
%% [blk,At,C,b] = read_sdpa(fname)
%%
%% Input: fname = name of the file containing SDP data in
%% SDPA foramt.
%% Important: the data is assumed to contain only
%% semide... |
github | anantsrivastava30/SUVR-PET-ADNI-master | sortA.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/sortA.m | 2,639 | utf_8 | c998ea7df87432b78f6c001d0bbc5318 | %%*********************************************************************
%% sortA: sort columns of At{p} in ascending order according to the
%% number of nonzero elements.
%%
%% [At,C,b,X0,Z0,permA,permZ] = sortA(blk,At,C,b,X0,Z0);
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tut... |
github | anantsrivastava30/SUVR-PET-ADNI-master | blkeig.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/blkeig.m | 2,412 | utf_8 | 97da97f8165585de45eae52a86e0f127 | %%***************************************************************************
%% blkeig: compute eigenvalue decomposition of a cell array
%% whose contents are square matrices or the diagonal
%% of a diagonal matrix.
%%
%% [d,V] = blkeig(blk,X);
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. ... |
github | anantsrivastava30/SUVR-PET-ADNI-master | HKMrhsfun.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/HKMrhsfun.m | 3,358 | utf_8 | b1e6a8305128af799634b9ef7324cfeb | %%*******************************************************************
%% HKMrhsfun: compute the right-hand side vector of the
%% Schur complement equation for the HKM direction.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%***********... |
github | anantsrivastava30/SUVR-PET-ADNI-master | linsysolve.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/linsysolve.m | 7,741 | utf_8 | 2091e9d1c0858acfd5c4e07842ed787d | %%***************************************************************
%% linsysolve: solve linear system to get dy, and direction
%% corresponding to unrestricted variables.
%%
%% [xx,coeff,L,resnrm] = linsysolve(schur,UU,Afree,EE,rhs);
%%
%% child functions: symqmr.m, mybicgstable.m, linsysolvefun.m
%%
%% SDPT... |
github | anantsrivastava30/SUVR-PET-ADNI-master | schurmat_qblk.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/schurmat_qblk.m | 3,205 | utf_8 | d154ddca57828c83c43efd37fbe64829 | %%*******************************************************************
%% schurmat_qblk: compute schur matrix corresponding to SOCP blocks.
%%
%% HKM direction: output = schur + Ax*Ae' + Ae*Ax' - Ad*Ad'
%% NT direction: output = schur + Ae*Ae' - Ad*Ad'
%%
%% where schur = A*D*A', and Ad is the modification to ADA'
%% s... |
github | anantsrivastava30/SUVR-PET-ADNI-master | ops.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/ops.m | 11,548 | utf_8 | 0931c97ce9eb7f01a28fac581153ca1c | %%******************************************************************
%% ops:
%%
%% Z = ops(X,operand,Y,alpha);
%%
%% INPUT: X = a matrix or a scalar
%% or a CELL ARRAY consisting only of matrices
%% operand = sym, transpose, triu, tril,
%% real, imag, sqrt, abs, ... |
github | anantsrivastava30/SUVR-PET-ADNI-master | schurmat_lblk.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/schurmat_lblk.m | 1,010 | utf_8 | 11b66919604e457c631f5ed67225fc45 | %%*******************************************************************
%% schurmat_lblk: compute A*D*A'
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%*******************************************************************
function [schur,UU,EE] = schu... |
github | anantsrivastava30/SUVR-PET-ADNI-master | sqlpmisc.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/sqlpmisc.m | 4,078 | utf_8 | 1dc032b6e1fd72eb26f2f3e519a746dd | %%*****************************************************************************
%% sqlpmisc:
%% unscale and produce infeasibility certificates if appropriate
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004.
%%******************************************... |
github | anantsrivastava30/SUVR-PET-ADNI-master | checkdense.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/checkdense.m | 730 | utf_8 | 6d44b41643ef16f78b42927e1fc03dd8 | %%********************************************************************
%% checkdense : identify the dense columns of a matrix
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%********************************************************************
funct... |
github | anantsrivastava30/SUVR-PET-ADNI-master | NTrhsfun.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/NTrhsfun.m | 4,253 | utf_8 | 51c74223afc232c456def8488b51aa3f | %%*******************************************************************
%% NTrhsfun: compute the right-hand side vector of the
%% Schur complement equation for the NT direction.
%%
%% SDPT3: version 3.1
%% Copyright (c) 1997 by
%% K.C. Toh, M.J. Todd, R.H. Tutuncu
%% Last Modified: 16 Sep 2004
%%***************... |
github | anantsrivastava30/SUVR-PET-ADNI-master | SDPvalBounds.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/SDPvalBounds.m | 1,843 | utf_8 | fa3af856805cc15685c38e69218a8ffb | %%*****************************************************************
%% compute lower and upper bounds for the exact primal
%% optimal value.
%%
%% LB <= true optimal dual value = true optimal primal value <= UB.
%%
%%*****************************************************************
function [LB,UB] = SDPvalBo... |
github | anantsrivastava30/SUVR-PET-ADNI-master | NTscaling.m | .m | SUVR-PET-ADNI-master/scripts/cvx/sdpt3/Solver/NTscaling.m | 1,847 | utf_8 | 82a266e8bf9cf33993f0bff10650c15c | %%**********************************************************************
%% NTscaling: Compute NT scaling matrix
%%
%% compute SVD of Xchol*Zchol via eigenvalue decompostion of
%% Zchol * X * Zchol' = V * diag(sv2) * V'.
%% compute W satisfying W*Z*W = X.
%% W = G'*G, where G = diag(sqrt(sv)) * (invZchol*V)'
%... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.