Overhaul code for VSDP 2020 release.

+solver/csdp.m

@@ -1,16 +1,15 @@
 classdef csdp < handle
-  % CSDP  Solver proxy class (not the acutal solver!).
+  % CSDP  Solver proxy class (not the actual solver!).
   %
   %   For more information about CSDP, see:
   %
-  %      https://projects.coin-or.org/Csdp/
   %      https://github.com/coin-or/Csdp
   %
   %   See also vsdp.solve.
   %
 
-  % Copyright 2004-2019 Christian Jansson ([email protected])
 
+  % Copyright 2004-2020 Christian Jansson ([email protected])
   methods (Static)
     function obj = solve (obj, sol_type)
       % SOLVE  Approximately solve conic problem instance with CSDP.

+solver/glpk.m

@@ -1,5 +1,5 @@
 classdef glpk < handle
-  % GLPK  Solver proxy class (not the acutal solver!).
+  % GLPK  Solver proxy class (not the actual solver!).
   %
   %   For more information about GLPK, see:
   %
@@ -8,8 +8,8 @@
   %   See also vsdp.solve.
   %
 
-  % Copyright 2004-2019 Christian Jansson ([email protected])
 
+  % Copyright 2004-2020 Christian Jansson ([email protected])
   methods (Static)
     function obj = solve (obj, sol_type)
       % SOLVE  Approximately solve conic problem instance with GLPK.

+solver/intlab.m

@@ -1,5 +1,5 @@
 classdef intlab < handle
-  % INTLAB  Solver proxy class (not the acutal solver!).
+  % INTLAB  Solver proxy class (not the actual solver!).
   %
   % For information about INTLAB, see:
   %
@@ -8,8 +8,8 @@
   %   See also vsdp.solve.
   %
 
-  % Copyright 2004-2019 Christian Jansson ([email protected])
 
+  % Copyright 2004-2020 Christian Jansson ([email protected])
   methods (Static)
     function spath = install (varargin)
       % Returns the path to the installed and usable solver.  Otherwise return

+solver/linprog.m

@@ -1,5 +1,5 @@
 classdef linprog < handle
-  % LINPROG  Solver proxy class (not the acutal solver!).
+  % LINPROG  Solver proxy class (not the actual solver!).
   %
   %   For more information about LINPROG, see:
   %
@@ -8,8 +8,8 @@
   %   See also vsdp.solve.
   %
 
-  % Copyright 2004-2019 Christian Jansson ([email protected])
 
+  % Copyright 2004-2020 Christian Jansson ([email protected])
   methods (Static)
     function obj = solve (obj, sol_type)
       % SOLVE  Approximately solve conic problem instance with LINPROG.

+solver/lp_solve.m

@@ -1,5 +1,5 @@
 classdef lp_solve < handle
-  % LP_SOLVE  Solver proxy class (not the acutal solver!).
+  % LP_SOLVE  Solver proxy class (not the actual solver!).
   %
   %   For more information about LP_SOLVE, see:
   %
@@ -8,8 +8,8 @@
   %   See also vsdp.solve.
   %
 
-  % Copyright 2004-2019 Christian Jansson ([email protected])
 
+  % Copyright 2004-2020 Christian Jansson ([email protected])
   methods (Static)
     function obj = solve (obj, sol_type)
       % SOLVE  Approximately solve conic problem instance with LP_SOLVE.

+solver/mosek.m

@@ -1,5 +1,5 @@
 classdef mosek < handle
-  % MOSEK  Solver proxy class (not the acutal solver!).
+  % MOSEK  Solver proxy class (not the actual solver!).
   %
   %   For more information on the MOSEK format, see:
   %
@@ -8,8 +8,8 @@
   %   See also vsdp.solve.
   %
 
-  % Copyright 2004-2019 Christian Jansson ([email protected])
 
+  % Copyright 2004-2020 Christian Jansson ([email protected])
   methods (Static)
     function obj = solve (obj, sol_type)
       % SOLVE  Approximately solve conic problem instance with MOSEK.

+solver/registry.m

@@ -4,8 +4,8 @@
   %   See also vsdp.solve.
   %
 
-  % Copyright 2004-2019 Christian Jansson ([email protected])
 
+  % Copyright 2004-2020 Christian Jansson ([email protected])
   methods (Static)
     function slist = list_all ()
       % LIST_ALL  Return a list with all solvers supported by VSDP.

+solver/sdpa.m

@@ -1,5 +1,5 @@
 classdef sdpa < handle
-  % SDPA  Solver proxy class (not the acutal solver!).
+  % SDPA  Solver proxy class (not the actual solver!).
   %
   %   For more information on the SDPA-M format, see:
   %
@@ -9,8 +9,8 @@
   %   See also vsdp.solve.
   %
 
-  % Copyright 2004-2019 Christian Jansson ([email protected])
 
+  % Copyright 2004-2020 Christian Jansson ([email protected])
   methods (Static)
     function obj = solve (obj, sol_type)
       % SOLVE  Approximately solve conic problem instance with SDPA.

+solver/sdpt3.m

@@ -1,5 +1,5 @@
 classdef sdpt3 < handle
-  % SDPT3  Solver proxy class (not the acutal solver!).
+  % SDPT3  Solver proxy class (not the actual solver!).
   %
   %   For information about SDPT3, see:
   %
@@ -9,8 +9,8 @@
   %   See also vsdp.solve.
   %
 
-  % Copyright 2004-2019 Christian Jansson ([email protected])
 
+  % Copyright 2004-2020 Christian Jansson ([email protected])
   methods (Static)
     function obj = solve (obj, sol_type)
       % SOLVE  Approximately solve conic problem instance with SDPT3.
@@ -110,7 +110,7 @@
       spath = solver.registry.generic_install (sname, is_available, ...
         get_path, installer_file, do_error);
 
-      % Return on sucess or non-interactive silent mode.
+      % Return on success or non-interactive silent mode.
       if ((nargin == 0) || (~isempty (spath)))
         return;
       end

+solver/sedumi.m

@@ -1,5 +1,5 @@
 classdef sedumi < handle
-  % SEDUMI  Solver proxy class (not the acutal solver!).
+  % SEDUMI  Solver proxy class (not the actual solver!).
   %
   %   For information about SeDuMi, see:
   %
@@ -9,8 +9,8 @@
   %   See also vsdp.solve.
   %
 
-  % Copyright 2004-2019 Christian Jansson ([email protected])
 
+  % Copyright 2004-2020 Christian Jansson ([email protected])
   methods (Static)
     function obj = solve (obj, sol_type)
       % SOLVE  Approximately solve conic problem instance with SeDuMi.
@@ -101,7 +101,7 @@
       spath = solver.registry.generic_install (sname, is_available, ...
         get_path, installer_file, do_error);
 
-      % Return on sucess or non-interactive silent mode.
+      % Return on success or non-interactive silent mode.
       if ((nargin == 0) || (~isempty (spath)))
         return;
       end

@vsdp/add_solution.m

@@ -6,7 +6,7 @@
 %
 %   See also vsdp, vsdp_solution.
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 if (nargin == 2)
   if (~isa (varargin{1}, 'vsdp_solution'))

@vsdp/analyze.m

@@ -22,7 +22,7 @@
 %   See also vsdp.
 %
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 narginchk (1, 3);
 if (nargout ~= 1)

@vsdp/cache.m

@@ -12,7 +12,7 @@
 %   See also vsdp.
 %
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 narginchk (2, 2);
 

@vsdp/cell2mat.m

@@ -17,7 +17,7 @@
 %   See also vsdp.
 %
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 if (iscell (X))
   x = cell2mat (cellfun (@(x) x(:), X, 'UniformOutput', false));

@vsdp/cell_sub_blocks.m

@@ -21,7 +21,7 @@
 %   See also vsdp, vsdp.cell2mat.
 %
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 if (nargin == 2 && iscell (X) && iscell (blk))
   idx = find (strcmp (blk(:,1), 's') & (cellfun (@length, blk(:,2)) > 1));

@vsdp/check_dual_infeasible.m

@@ -26,7 +26,7 @@
 %            vsdp.check_primal_infeasible.
 %
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 narginchk (1, 2);
 

@vsdp/check_primal_infeasible.m

@@ -42,7 +42,7 @@
 %            vsdp.check_dual_infeasible.
 %
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 narginchk (1, 2);
 

@vsdp/disp.m

@@ -3,7 +3,7 @@ function disp (obj)
 %
 %   See also vsdp.info.
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 % Determine object name.
 obj_name = inputname(1);

@vsdp/from_2006_fmt.m

@@ -39,7 +39,7 @@
 %
 %   See also vsdp.
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 narginchk (4, 7);
 

@vsdp/from_lp_solve_fmt.m

@@ -31,7 +31,7 @@
 %   See also from_mps_file.
 %
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 narginchk(4, 6);
 b = b(:);

@vsdp/from_mps_file.m

@@ -13,7 +13,7 @@
 %   See also from_lp_solve_fmt.
 %
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 narginchk(1, 1);
 if (exist (fname, 'file') ~= 2)
@@ -110,7 +110,7 @@
 %                  columns i, j and k are in an SOS2 set
 %
 
-% Copyright 2004-2012 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 % initialize default output
 problem.name = '';

@vsdp/from_sdpa_file.m

@@ -13,7 +13,7 @@
 %   See also vsdp.
 %
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 narginchk(1, 2);
 if (exist (fname, 'file') ~= 2)

@vsdp/from_sdpa_fmt.m

@@ -43,7 +43,7 @@
 %
 %   See also from_sdpa_file.
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 narginchk(3, 6);
 if (isempty (bLOCKsTRUCT))

@vsdp/from_sdpt3_fmt.m

@@ -54,13 +54,12 @@
 %
 %   For more information on the SDPT3-4.0 format, see:
 %
-%     [1] http://www.math.nus.edu.sg/~mattohkc/sdpt3/guide4-0-draft.pdf
-%     [2] http://www.math.nus.edu.sg/~mattohkc/sdpt3/sdpexample.html
+%     https://blog.nus.edu.sg/mattohkc/files/2019/10/guide4-0-draft.pdf
 %
 %   See also vsdp.
 %
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 narginchk(4, 7);
 

@vsdp/get_midpoint_problem_data.m

@@ -4,7 +4,7 @@
 %   See also vsdp.
 %
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 [At, b, c] = deal (mid (obj.At), mid (obj.b), mid (obj.c));
 if ((nargin > 1) && ~strcmp (sol_type, "Approximate"))

@vsdp/info.m

@@ -4,7 +4,7 @@ function info (obj)
 %   See also vsdp.
 %
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 % Short conic programming theory.
 fprintf ('\n  VSDP conic programming problem in primal (P) dual (D) form:\n\n');

@vsdp/rigorous_lower_bound.m

@@ -32,7 +32,7 @@
 %   See also vsdp, vsdp.rigorous_upper_bound.
 %
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 narginchk (1, 2);
 

@vsdp/rigorous_lower_cone_bound.m

@@ -34,7 +34,7 @@
 %   See also vsdp, vsdp.rigorous_lower_bound, vsdp.rigorous_upper_bound.
 %
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 n  = obj.K.f + obj.K.l + length (obj.K.q) + length (obj.K.s);
 

@vsdp/rigorous_upper_bound.m

@@ -22,7 +22,7 @@
 %   See also vsdp, vsdp.rigorous_lower_bound.
 %
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 % Validate dual upper bounds.
 if (nargin == 2)

@vsdp/settings.m

@@ -11,7 +11,7 @@
 %      val = vsdp.settings ('id', 'key');
 %
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 persistent vsdp_settings;  % In memory copy of VSDP settings file.
 persistent settings_file;
@@ -51,5 +51,5 @@
 % SYS_HASH  Compute a system unique hash value.
 %
 
-val = sum (double ([computer(), '_vsdp_2018_', version()]));
+val = sum (double ([computer(), '_vsdp_2020_', version()]));
 end

@vsdp/sindex.m

@@ -84,7 +84,7 @@
 %   See also vsdp, vsdp.svec, vsdp.smat.
 %
 
-% Copyright 2004-2019 Christian Jansson ([email protected])
+% Copyright 2004-2020 Christian Jansson ([email protected])
 
 if (isa (obj, 'vsdp'))
   K = obj.K;