-
Notifications
You must be signed in to change notification settings - Fork 24
/
Copy pathcdcsOpts.m
66 lines (61 loc) · 3.04 KB
/
cdcsOpts.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
54
55
56
57
58
59
60
61
62
63
64
65
function options = cdcsOpts
% CDCSOPTS
%
% Default options for <a href="matlab:help('cdcs')">CDCS</a>.
%
% Generic solver options
% ----------------------
% options.solver = 'hsde'; % which solver (primal/dual/hsde/sos)
% options.relTol = 1e-4; % tolerance
% options.rescale = true; % scale data to improve convergence
% options.verbose = 1; % print or silent
% options.dispIter = 50; % print every dispIter iterations
% options.maxIter = 1000; % max # iterations
%
% Chordal decomposition options
% -----------------------------
% options.chordalize = 1; % how to decompose the constraints (0/1/2)
% options.yPenalty = true; % add penalty term for Y block to cost
% options.completion = true; % complete the unused entries of the decomposed
% primal variable
%
% ADMM penalty options
% --------------------
% options.rho = 1; % penalty parameter
% options.adaptive = true; % adaptive penalty factor?
% options.tau = 2; % increase factor for adaptive penalty scheme
% (must be > 1)
% options.mu = 10; % ratio of residuals for adaptive penalty scheme
% options.rhoMax = 1e6; % maximum penalty parameter
% options.rhoMin = 1e-6; % minimum penalty parameter
% options.rhoIt = 10; % if pres/dres>mu (<mu) mu for rhoIt iterations,
% increase (decrease) options.rho
%
% Advanced options
% ----------------
% options.KKTfact = 'blk'; % Options for KKT systems
% % a) 'blk': block elimination,
% % b) 'ldl': ldl factor,
% % c) 'inv': invert
%
% See also CDCS
% Create options structure
options.solver = 'hsde'; % which solver (primal/dual/hsde)
options.relTol = 1e-4; % tolerance
options.rescale = true; % scale data to improve convergence
options.verbose = 1; % print or silent
options.dispIter = 50; % print every dispIter iterations
options.maxIter = 1000; % max # iterations
options.chordalize = 1; % how to decompose the constraints (1/2)
options.yPenalty = true; % add penalty term for Y block to cost
options.completion = true; % complete the unused entries of the primal variable
options.rho = 1; % penalty parameter
options.adaptive = true; % adaptive penalty factor?
options.mu = 2; % increase/decrease factor for adaptive penalty scheme (must be > 1)
options.nu = 10; % ratio of residuals for adaptive penalty scheme
options.rhoMax = 1e6; % maximum penalty parameter
options.rhoMin = 1e-6; % minimum penalty parameter
options.rhoIt = 10; % if pres/dres>mu (<mu) mu for rhoIt iterations, adapt rho
options.KKTfact = 'blk'; % Options for KKT systems
% the following is for self-dual embedding
options.alpha = 1.8; % over relaxation, must lie in (0,2); 1.8 is used in SCS