CONOPT
Loading...
Searching...
No Matches
qp3.java
Go to the documentation of this file.
1
7
8import java.util.*;
9import java.lang.Math;
10import jconopt.*;
11
14public class qp3 {
15 public static void main(String argv[]){
16 System.loadLibrary("conopt4_java");
17
18 String name = "qp3";
19
20 Conopt conopt = new Conopt(name);
21 qp3_TutModelData model = new qp3_TutModelData();
23
24 model.buildModel();
25
26 conopt.loadModel(model);
27 conopt.setMessageHandler(msghdlr);
28
29 // try to set the license using the environment variables
30 try {
31 int license_int_1 = Integer.parseInt(System.getenv("LICENSE_INT_1"));
32 int license_int_2 = Integer.parseInt(System.getenv("LICENSE_INT_2"));
33 int license_int_3 = Integer.parseInt(System.getenv("LICENSE_INT_3"));
34 String license_text = System.getenv("LICENSE_TEXT");
35
38 } catch (Exception e) {
39 System.out.println("Unable to set license: " + e.getMessage());
40 }
41
42 conopt.solve();
43
44 conopt.printStatus();
45
46 std s = new std();
47 int retcode = s.checkSolve(name, conopt.modelStatus(), conopt.solutionStatus(),
48 conopt.objectiveValue(), 59978.0, 0.001);
49
50 msghdlr.close();
51
52 System.exit(retcode);
53 }
54}
55
56class qp3_TutModelData extends ModelData {
57 private int NN;
58 private int NQ;
59 private double[] target;
60 private double[] Qdiag;
61 private double[] Qlowerdiag;
62
63 public qp3_TutModelData() {
64 super();
65
66 setConstants();
67 }
68
69 private void setConstants() {
70 NN = 1000;
71 NQ = NN*2 - 1;
72 target = new double[NN];
73 Qdiag = new double[NN];
74 Qlowerdiag = new double[NN];
75 for (int i = 0; i < NN; i++)
76 {
77 target[i] = 10;
78 Qdiag[i] = 1;
79 }
80
81 for (int i = 0; i < NN - 1; i++)
82 Qlowerdiag[i] = 0.1;
83 }
84
89 public void buildModel() {
90 // adding the variables to the model
91 for (int i = 0; i < NN; i++)
93
94 // adding the constraints to the model
95 // first we create some arrays to help build the model.
96 int[] varindex = new int[NN];
97 int[] zeros = new int[NN];
98 int[] ones = new int[NN];
99 for (int i = 0; i < NN; i++)
100 {
101 varindex[i] = i;
102 zeros[i] = 0;
103 ones[i] = 1;
104 }
105
106 // the first constraint is the quadratic objective
107 addConstraint(ConstraintType.Free, 0.0, varindex,
108 Arrays.stream(zeros).asDoubleStream().toArray(), ones);
109
110 // the second constraint is the summation constraint: sum(x) == 1
111 addConstraint(ConstraintType.Eq, 1.0, varindex,
112 Arrays.stream(ones).asDoubleStream().toArray(), zeros);
113
114 // setting the objective constraint
116
117 // setting the optimisation direction
119
120 // setting the structure of the hessian of the lagrangian
121 setLagrangianStructure();
122 }
123
124 private void setLagrangianStructure() {
125 int[] hessianrow = new int[NQ];
126 int[] hessiancol = new int[NQ];
127
128 // defining the non-zero structure of the hessian
129 for (int i = 0; i < NN - 1; i++)
130 {
131 hessianrow[2*i] = i;
132 hessianrow[2*i + 1] = i + 1;
133
134 hessiancol[2*i] = i;
135 hessiancol[2*i + 1] = i;
136 }
137 hessianrow[NQ - 1] = NN - 1;
138 hessiancol[NQ - 1] = NN - 1;
139
140 // setting the structure of the hessian of the lagrangian
141 setSDLagrangianStructure(hessianrow, hessiancol);
142 }
143
148 public double evaluateNonlinearTerm(double[] x, int rowno, boolean ignerr, int thread)
149 {
150 double g = 0;
151 if (rowno == 0)
152 {
153 for (int i = 0; i < NN; i++)
154 g += (x[i] - target[i])*Qdiag[i]*(x[i] - target[i]);
155 for (int i = 0; i < NN - 1; i++)
156 g += 2*(x[i + 1] - target[i + 1])*Qlowerdiag[i]*(x[i] - target[i]);
157 }
158
159 return g/2;
160 }
161
166 public void evaluateNonlinearJacobian(double[] x, double[] jac, int rowno, int[] jacnum, boolean ignerr, int thread) {
167 assert x.length == jac.length;
168
169 if (rowno == 0)
170 {
171 for (int i = 0; i < NN; i++)
172 jac[i] += Qdiag[i]*(x[i] - target[i]);
173
174 for (int i = 0; i < NN - 1; i++)
175 {
176 jac[i + 1] += Qlowerdiag[i]*(x[i] - target[i]);
177 jac[i] += Qlowerdiag[i]*(x[i + 1] - target[i + 1]);
178 }
179 }
180 }
181
182
187 public void evaluateSDLagrangian(double[] x, double[] u, int[] hessianrow, int[] hessiancol, double[] hessianval) {
188 assert hessianrow.length == hessianval.length;
189 assert hessiancol.length == hessianval.length;
190
191 for (int i = 0; i < NN - 1; i++)
192 {
193 hessianval[2*i] = Qdiag[i]*u[0];
194 hessianval[2*i + 1] = Qlowerdiag[i]*u[0];
195 }
196 hessianval[NQ - 1] = Qdiag[NN - 1]*u[0];
197 }
198}
static final ConstraintType Eq
static final ConstraintType Free
A class that can be extended to build and solve a model using Conopt.
static final ObjectiveElement Constraint
static final Sense Minimize
Definition Sense.java:25
license_int_3
Definition qp3.py:128
license_int_2
Definition qp3.py:127
model
Definition qp3.py:117
license_text
Definition qp3.py:129
static void main(String argv[])
Definition qp3.java:15
license_int_1
Definition qp3.py:126
msghdlr
Definition qp3.py:118
name
Definition qp3.py:114
retcode
Definition qp3.py:137
conopt
Definition qp3.py:116
static int checkSolve(String name, int model_status, int solution_status, double objective, double expected_objective, double tol)
Definition std.java:16
void setObjectiveElement(ObjectiveElement elem, int elemindex)
void setOptimizationSense(Sense sense)
int addVariable(double lower, double upper, double curr, int varstatus)
int addConstraint(ConstraintType constype, double rhs, int slackstatus)
void setSDLagrangianStructure(int[] rownum, int[] colnum)
void evaluateNonlinearJacobian(double[] x, double[] jac, int rowno, int[] jacnum, boolean ignerr, int thread)
callback method for evaluating the jacobian for the nonlinear terms in a given row
Definition qp3.java:166
double evaluateNonlinearTerm(double[] x, int rowno, boolean ignerr, int thread)
callback method for evaluating the nonlinear terms in a given row
Definition qp3.java:148
void buildModel()
adds variables and constraints to the model
Definition qp3.java:89
void evaluateSDLagrangian(double[] x, double[] u, int[] hessianrow, int[] hessiancol, double[] hessianval)
Computes and returns the numerical values of the Lagrangian of the Hessian.
Definition qp3.java:187
static final double CONOPT_INF
Definition qp3.py:1
Definition std.py:1
#define NN
Definition qp1.c:21
#define NQ
Definition qp1.c:22