
| Classes | |
| class | SolutionInfo | 
| Package Functions | |
| double | calculate_rho () | 
| void | do_shrinking () | 
| double | get_C (int i) | 
| boolean | is_free (int i) | 
| boolean | is_lower_bound (int i) | 
| boolean | is_upper_bound (int i) | 
| void | reconstruct_gradient () | 
| int | select_working_set (int[] working_set) | 
| void | Solve (int l, QMatrix Q, double[] p_, byte[] y_, double[] alpha_, double Cp, double Cn, double eps, SolutionInfo si, int shrinking) | 
| void | swap_index (int i, int j) | 
| void | update_alpha_status (int i) | 
| Package Attributes | |
| int[] | active_set | 
| int | active_size | 
| double[] | alpha | 
| byte[] | alpha_status | 
| double | Cn | 
| double | Cp | 
| double | eps | 
| double[] | G | 
| double[] | G_bar | 
| int | l | 
| double[] | p | 
| QMatrix | Q | 
| double[] | QD | 
| boolean | unshrink | 
| byte[] | y | 
| Static Package Attributes | |
| static final byte | FREE = 2 | 
| static final double | INF = java.lang.Double.POSITIVE_INFINITY | 
| static final byte | LOWER_BOUND = 0 | 
| static final byte | UPPER_BOUND = 1 | 
| Private Member Functions | |
| boolean | be_shrunk (int i, double Gmax1, double Gmax2) | 
| boolean libsvm.Solver.be_shrunk | ( | int | i, | 
| double | Gmax1, | ||
| double | Gmax2 | ||
| ) |  [inline, private] | 
| double libsvm.Solver.calculate_rho | ( | ) |  [inline, package] | 
Reimplemented in libsvm.Solver_NU.
| void libsvm.Solver.do_shrinking | ( | ) |  [inline, package] | 
Reimplemented in libsvm.Solver_NU.
| double libsvm.Solver.get_C | ( | int | i | ) |  [inline, package] | 
| boolean libsvm.Solver.is_free | ( | int | i | ) |  [inline, package] | 
| boolean libsvm.Solver.is_lower_bound | ( | int | i | ) |  [inline, package] | 
| boolean libsvm.Solver.is_upper_bound | ( | int | i | ) |  [inline, package] | 
| void libsvm.Solver.reconstruct_gradient | ( | ) |  [inline, package] | 
| int libsvm.Solver.select_working_set | ( | int[] | working_set | ) |  [inline, package] | 
Reimplemented in libsvm.Solver_NU.
| void libsvm.Solver.Solve | ( | int | l, | 
| QMatrix | Q, | ||
| double[] | p_, | ||
| byte[] | y_, | ||
| double[] | alpha_, | ||
| double | Cp, | ||
| double | Cn, | ||
| double | eps, | ||
| SolutionInfo | si, | ||
| int | shrinking | ||
| ) |  [inline, package] | 
Reimplemented in libsvm.Solver_NU.
| void libsvm.Solver.swap_index | ( | int | i, | 
| int | j | ||
| ) |  [inline, package] | 
| void libsvm.Solver.update_alpha_status | ( | int | i | ) |  [inline, package] | 
| int [] libsvm.Solver.active_set  [package] | 
| int libsvm.Solver.active_size  [package] | 
| double [] libsvm.Solver.alpha  [package] | 
| byte [] libsvm.Solver.alpha_status  [package] | 
| double libsvm.Solver.Cn  [package] | 
| double libsvm.Solver.Cp  [package] | 
| double libsvm.Solver.eps  [package] | 
| final byte libsvm.Solver.FREE = 2  [static, package] | 
| double [] libsvm.Solver.G  [package] | 
| double [] libsvm.Solver.G_bar  [package] | 
| final double libsvm.Solver.INF = java.lang.Double.POSITIVE_INFINITY  [static, package] | 
| int libsvm.Solver.l  [package] | 
| final byte libsvm.Solver.LOWER_BOUND = 0  [static, package] | 
| double [] libsvm.Solver.p  [package] | 
| QMatrix libsvm.Solver.Q  [package] | 
| double [] libsvm.Solver.QD  [package] | 
| boolean libsvm.Solver.unshrink  [package] | 
| final byte libsvm.Solver.UPPER_BOUND = 1  [static, package] | 
| byte [] libsvm.Solver.y  [package] |