Google OR-Tools v9.9
a fast and portable software suite for combinatorial optimization
|
Definition at line 10165 of file SolveLogOuterClass.java.
operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getConvergenceInformation | ( | int | index | ) |
A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality. This field is repeated since there might be several different points that are considered.
repeated .operations_research.pdlp.ConvergenceInformation convergence_information = 2;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
int operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getConvergenceInformationCount | ( | ) |
A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality. This field is repeated since there might be several different points that are considered.
repeated .operations_research.pdlp.ConvergenceInformation convergence_information = 2;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
java.util.List< operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation > operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getConvergenceInformationList | ( | ) |
A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality. This field is repeated since there might be several different points that are considered.
repeated .operations_research.pdlp.ConvergenceInformation convergence_information = 2;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
operations_research.pdlp.SolveLogOuterClass.ConvergenceInformationOrBuilder operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getConvergenceInformationOrBuilder | ( | int | index | ) |
A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality. This field is repeated since there might be several different points that are considered.
repeated .operations_research.pdlp.ConvergenceInformation convergence_information = 2;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
java.util.List<? extends operations_research.pdlp.SolveLogOuterClass.ConvergenceInformationOrBuilder > operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getConvergenceInformationOrBuilderList | ( | ) |
A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality. This field is repeated since there might be several different points that are considered.
repeated .operations_research.pdlp.ConvergenceInformation convergence_information = 2;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
double operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getCumulativeKktMatrixPasses | ( | ) |
The cumulative number of passes through the KKT matrix since the start of the solve. One pass is a multply by the constraint matrix, its transpose and the matrix that defines the quadratic part of the objective. For example, each iteration of mirror saddle prox contributes 2.0 to this sum. This is a float because it can include fractional passes through the data. For example, in an active set method we may only use a submatrix with 20% of the nonzeros of the KKT matrix at each iteration in which case 0.2 would be added to the total.
optional double cumulative_kkt_matrix_passes = 4;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
int operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getCumulativeRejectedSteps | ( | ) |
The total number of rejected steps (e.g., within a line search procedure) since the start of the solve.
optional int32 cumulative_rejected_steps = 5;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
double operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getCumulativeTimeSec | ( | ) |
The amount of time passed since we started solving the problem (see solver log `solve_time_sec` which records total time).
optional double cumulative_time_sec = 6;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getInfeasibilityInformation | ( | int | index | ) |
A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution). This field is repeated since there might be several different points that could establish infeasibility.
repeated .operations_research.pdlp.InfeasibilityInformation infeasibility_information = 3;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
int operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getInfeasibilityInformationCount | ( | ) |
A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution). This field is repeated since there might be several different points that could establish infeasibility.
repeated .operations_research.pdlp.InfeasibilityInformation infeasibility_information = 3;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
java.util.List< operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation > operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getInfeasibilityInformationList | ( | ) |
A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution). This field is repeated since there might be several different points that could establish infeasibility.
repeated .operations_research.pdlp.InfeasibilityInformation infeasibility_information = 3;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuilder operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getInfeasibilityInformationOrBuilder | ( | int | index | ) |
A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution). This field is repeated since there might be several different points that could establish infeasibility.
repeated .operations_research.pdlp.InfeasibilityInformation infeasibility_information = 3;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
java.util.List<? extends operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuilder > operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getInfeasibilityInformationOrBuilderList | ( | ) |
A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution). This field is repeated since there might be several different points that could establish infeasibility.
repeated .operations_research.pdlp.InfeasibilityInformation infeasibility_information = 3;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
int operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getIterationNumber | ( | ) |
The iteration number at which these stats were recorded. By convention, iteration counts start at 1, and the stats correspond to the solution *after* the iteration. Therefore stats from iteration 0 are the stats at the starting point.
optional int32 iteration_number = 1;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
operations_research.pdlp.SolveLogOuterClass.PointMetadata operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getPointMetadata | ( | int | index | ) |
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
int operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getPointMetadataCount | ( | ) |
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
java.util.List< operations_research.pdlp.SolveLogOuterClass.PointMetadata > operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getPointMetadataList | ( | ) |
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
operations_research.pdlp.SolveLogOuterClass.PointMetadataOrBuilder operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getPointMetadataOrBuilder | ( | int | index | ) |
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
java.util.List<? extends operations_research.pdlp.SolveLogOuterClass.PointMetadataOrBuilder > operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getPointMetadataOrBuilderList | ( | ) |
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
double operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getPrimalWeight | ( | ) |
Primal weight controlling the relation between primal and dual step sizes. See field 'step_size' for a detailed description.
optional double primal_weight = 9;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
operations_research.pdlp.SolveLogOuterClass.RestartChoice operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getRestartUsed | ( | ) |
The kind of restart that occurred at this iteration, or NO_RESTART if a restart did not occur.
optional .operations_research.pdlp.RestartChoice restart_used = 7;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
double operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.getStepSize | ( | ) |
Step size used at this iteration. Note that the step size used for the primal update is step_size / primal_weight, while the one used for the dual update is step_size * primal_weight.
optional double step_size = 8;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
boolean operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.hasCumulativeKktMatrixPasses | ( | ) |
The cumulative number of passes through the KKT matrix since the start of the solve. One pass is a multply by the constraint matrix, its transpose and the matrix that defines the quadratic part of the objective. For example, each iteration of mirror saddle prox contributes 2.0 to this sum. This is a float because it can include fractional passes through the data. For example, in an active set method we may only use a submatrix with 20% of the nonzeros of the KKT matrix at each iteration in which case 0.2 would be added to the total.
optional double cumulative_kkt_matrix_passes = 4;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
boolean operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.hasCumulativeRejectedSteps | ( | ) |
The total number of rejected steps (e.g., within a line search procedure) since the start of the solve.
optional int32 cumulative_rejected_steps = 5;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
boolean operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.hasCumulativeTimeSec | ( | ) |
The amount of time passed since we started solving the problem (see solver log `solve_time_sec` which records total time).
optional double cumulative_time_sec = 6;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
boolean operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.hasIterationNumber | ( | ) |
The iteration number at which these stats were recorded. By convention, iteration counts start at 1, and the stats correspond to the solution *after* the iteration. Therefore stats from iteration 0 are the stats at the starting point.
optional int32 iteration_number = 1;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
boolean operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.hasPrimalWeight | ( | ) |
Primal weight controlling the relation between primal and dual step sizes. See field 'step_size' for a detailed description.
optional double primal_weight = 9;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
boolean operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.hasRestartUsed | ( | ) |
The kind of restart that occurred at this iteration, or NO_RESTART if a restart did not occur.
optional .operations_research.pdlp.RestartChoice restart_used = 7;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.
boolean operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.hasStepSize | ( | ) |
Step size used at this iteration. Note that the step size used for the primal update is step_size / primal_weight, while the one used for the dual update is step_size * primal_weight.
optional double step_size = 8;
Implemented in operations_research.pdlp.SolveLogOuterClass.IterationStats, and operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.