Google OR-Tools v9.9
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder Class Reference
Inheritance diagram for operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder:
operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder

Public Member Functions

Builder clear ()
 
com.google.protobuf.Descriptors.Descriptor getDescriptorForType ()
 
operations_research.pdlp.SolveLogOuterClass.IterationStats getDefaultInstanceForType ()
 
operations_research.pdlp.SolveLogOuterClass.IterationStats build ()
 
operations_research.pdlp.SolveLogOuterClass.IterationStats buildPartial ()
 
Builder clone ()
 
Builder setField (com.google.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value)
 
Builder clearField (com.google.protobuf.Descriptors.FieldDescriptor field)
 
Builder clearOneof (com.google.protobuf.Descriptors.OneofDescriptor oneof)
 
Builder setRepeatedField (com.google.protobuf.Descriptors.FieldDescriptor field, int index, java.lang.Object value)
 
Builder addRepeatedField (com.google.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value)
 
Builder mergeFrom (com.google.protobuf.Message other)
 
Builder mergeFrom (operations_research.pdlp.SolveLogOuterClass.IterationStats other)
 
final boolean isInitialized ()
 
Builder mergeFrom (com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException
 
boolean hasIterationNumber ()
 
int getIterationNumber ()
 
Builder setIterationNumber (int value)
 
Builder clearIterationNumber ()
 
java.util.List< operations_research.pdlp.SolveLogOuterClass.ConvergenceInformationgetConvergenceInformationList ()
 
int getConvergenceInformationCount ()
 
operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation getConvergenceInformation (int index)
 
Builder setConvergenceInformation (int index, operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation value)
 
Builder setConvergenceInformation (int index, operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation.Builder builderForValue)
 
Builder addConvergenceInformation (operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation value)
 
Builder addConvergenceInformation (int index, operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation value)
 
Builder addConvergenceInformation (operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation.Builder builderForValue)
 
Builder addConvergenceInformation (int index, operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation.Builder builderForValue)
 
Builder addAllConvergenceInformation (java.lang.Iterable<? extends operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation > values)
 
Builder clearConvergenceInformation ()
 
Builder removeConvergenceInformation (int index)
 
operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation.Builder getConvergenceInformationBuilder (int index)
 
operations_research.pdlp.SolveLogOuterClass.ConvergenceInformationOrBuilder getConvergenceInformationOrBuilder (int index)
 
java.util.List<? extends operations_research.pdlp.SolveLogOuterClass.ConvergenceInformationOrBuildergetConvergenceInformationOrBuilderList ()
 
operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation.Builder addConvergenceInformationBuilder ()
 
operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation.Builder addConvergenceInformationBuilder (int index)
 
java.util.List< operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation.BuildergetConvergenceInformationBuilderList ()
 
java.util.List< operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationgetInfeasibilityInformationList ()
 
int getInfeasibilityInformationCount ()
 
operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation getInfeasibilityInformation (int index)
 
Builder setInfeasibilityInformation (int index, operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation value)
 
Builder setInfeasibilityInformation (int index, operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder builderForValue)
 
Builder addInfeasibilityInformation (operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation value)
 
Builder addInfeasibilityInformation (int index, operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation value)
 
Builder addInfeasibilityInformation (operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder builderForValue)
 
Builder addInfeasibilityInformation (int index, operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder builderForValue)
 
Builder addAllInfeasibilityInformation (java.lang.Iterable<? extends operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation > values)
 
Builder clearInfeasibilityInformation ()
 
Builder removeInfeasibilityInformation (int index)
 
operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder getInfeasibilityInformationBuilder (int index)
 
operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuilder getInfeasibilityInformationOrBuilder (int index)
 
java.util.List<? extends operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuildergetInfeasibilityInformationOrBuilderList ()
 
operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder addInfeasibilityInformationBuilder ()
 
operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder addInfeasibilityInformationBuilder (int index)
 
java.util.List< operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.BuildergetInfeasibilityInformationBuilderList ()
 
java.util.List< operations_research.pdlp.SolveLogOuterClass.PointMetadatagetPointMetadataList ()
 
int getPointMetadataCount ()
 
operations_research.pdlp.SolveLogOuterClass.PointMetadata getPointMetadata (int index)
 
Builder setPointMetadata (int index, operations_research.pdlp.SolveLogOuterClass.PointMetadata value)
 
Builder setPointMetadata (int index, operations_research.pdlp.SolveLogOuterClass.PointMetadata.Builder builderForValue)
 
Builder addPointMetadata (operations_research.pdlp.SolveLogOuterClass.PointMetadata value)
 
Builder addPointMetadata (int index, operations_research.pdlp.SolveLogOuterClass.PointMetadata value)
 
Builder addPointMetadata (operations_research.pdlp.SolveLogOuterClass.PointMetadata.Builder builderForValue)
 
Builder addPointMetadata (int index, operations_research.pdlp.SolveLogOuterClass.PointMetadata.Builder builderForValue)
 
Builder addAllPointMetadata (java.lang.Iterable<? extends operations_research.pdlp.SolveLogOuterClass.PointMetadata > values)
 
Builder clearPointMetadata ()
 
Builder removePointMetadata (int index)
 
operations_research.pdlp.SolveLogOuterClass.PointMetadata.Builder getPointMetadataBuilder (int index)
 
operations_research.pdlp.SolveLogOuterClass.PointMetadataOrBuilder getPointMetadataOrBuilder (int index)
 
java.util.List<? extends operations_research.pdlp.SolveLogOuterClass.PointMetadataOrBuildergetPointMetadataOrBuilderList ()
 
operations_research.pdlp.SolveLogOuterClass.PointMetadata.Builder addPointMetadataBuilder ()
 
operations_research.pdlp.SolveLogOuterClass.PointMetadata.Builder addPointMetadataBuilder (int index)
 
java.util.List< operations_research.pdlp.SolveLogOuterClass.PointMetadata.BuildergetPointMetadataBuilderList ()
 
boolean hasCumulativeKktMatrixPasses ()
 
double getCumulativeKktMatrixPasses ()
 
Builder setCumulativeKktMatrixPasses (double value)
 
Builder clearCumulativeKktMatrixPasses ()
 
boolean hasCumulativeRejectedSteps ()
 
int getCumulativeRejectedSteps ()
 
Builder setCumulativeRejectedSteps (int value)
 
Builder clearCumulativeRejectedSteps ()
 
boolean hasCumulativeTimeSec ()
 
double getCumulativeTimeSec ()
 
Builder setCumulativeTimeSec (double value)
 
Builder clearCumulativeTimeSec ()
 
boolean hasRestartUsed ()
 
operations_research.pdlp.SolveLogOuterClass.RestartChoice getRestartUsed ()
 
Builder setRestartUsed (operations_research.pdlp.SolveLogOuterClass.RestartChoice value)
 
Builder clearRestartUsed ()
 
boolean hasStepSize ()
 
double getStepSize ()
 
Builder setStepSize (double value)
 
Builder clearStepSize ()
 
boolean hasPrimalWeight ()
 
double getPrimalWeight ()
 
Builder setPrimalWeight (double value)
 
Builder clearPrimalWeight ()
 
final Builder setUnknownFields (final com.google.protobuf.UnknownFieldSet unknownFields)
 
final Builder mergeUnknownFields (final com.google.protobuf.UnknownFieldSet unknownFields)
 

Static Public Member Functions

static final com.google.protobuf.Descriptors.Descriptor getDescriptor ()
 

Protected Member Functions

com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable ()
 

Detailed Description

All values in IterationStats assume that the primal quadratic program is a
minimization problem and the dual is a maximization problem. Problems should
be transformed to this form if they are not already in this form. The dual
vector is defined to be the vector of multipliers on the linear constraints,
that is, excluding dual multipliers on variable bounds (reduced costs).

Protobuf type operations_research.pdlp.IterationStats

Definition at line 11276 of file SolveLogOuterClass.java.

Member Function Documentation

◆ addAllConvergenceInformation()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addAllConvergenceInformation ( java.lang.Iterable<? extends operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation > values)
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;

Definition at line 11963 of file SolveLogOuterClass.java.

◆ addAllInfeasibilityInformation()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addAllInfeasibilityInformation ( java.lang.Iterable<? extends operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation > values)
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;

Definition at line 12311 of file SolveLogOuterClass.java.

◆ addAllPointMetadata()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addAllPointMetadata ( java.lang.Iterable<? extends operations_research.pdlp.SolveLogOuterClass.PointMetadata > values)
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Definition at line 12639 of file SolveLogOuterClass.java.

◆ addConvergenceInformation() [1/4]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addConvergenceInformation ( int index,
operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation value )
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;

Definition at line 11900 of file SolveLogOuterClass.java.

◆ addConvergenceInformation() [2/4]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addConvergenceInformation ( int index,
operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation.Builder builderForValue )
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;

Definition at line 11943 of file SolveLogOuterClass.java.

◆ addConvergenceInformation() [3/4]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addConvergenceInformation ( operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation value)
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;

Definition at line 11878 of file SolveLogOuterClass.java.

◆ addConvergenceInformation() [4/4]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addConvergenceInformation ( operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation.Builder builderForValue)
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;

Definition at line 11923 of file SolveLogOuterClass.java.

◆ addConvergenceInformationBuilder() [1/2]

operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation.Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addConvergenceInformationBuilder ( )
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;

Definition at line 12068 of file SolveLogOuterClass.java.

◆ addConvergenceInformationBuilder() [2/2]

operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation.Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addConvergenceInformationBuilder ( 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;

Definition at line 12081 of file SolveLogOuterClass.java.

◆ addInfeasibilityInformation() [1/4]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addInfeasibilityInformation ( int index,
operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation value )
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;

Definition at line 12248 of file SolveLogOuterClass.java.

◆ addInfeasibilityInformation() [2/4]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addInfeasibilityInformation ( int index,
operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder builderForValue )
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;

Definition at line 12291 of file SolveLogOuterClass.java.

◆ addInfeasibilityInformation() [3/4]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addInfeasibilityInformation ( operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation value)
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;

Definition at line 12226 of file SolveLogOuterClass.java.

◆ addInfeasibilityInformation() [4/4]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addInfeasibilityInformation ( operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder builderForValue)
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;

Definition at line 12271 of file SolveLogOuterClass.java.

◆ addInfeasibilityInformationBuilder() [1/2]

operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addInfeasibilityInformationBuilder ( )
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;

Definition at line 12416 of file SolveLogOuterClass.java.

◆ addInfeasibilityInformationBuilder() [2/2]

operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addInfeasibilityInformationBuilder ( 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;

Definition at line 12429 of file SolveLogOuterClass.java.

◆ addPointMetadata() [1/4]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addPointMetadata ( int index,
operations_research.pdlp.SolveLogOuterClass.PointMetadata value )
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Definition at line 12582 of file SolveLogOuterClass.java.

◆ addPointMetadata() [2/4]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addPointMetadata ( int index,
operations_research.pdlp.SolveLogOuterClass.PointMetadata.Builder builderForValue )
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Definition at line 12621 of file SolveLogOuterClass.java.

◆ addPointMetadata() [3/4]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addPointMetadata ( operations_research.pdlp.SolveLogOuterClass.PointMetadata value)
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Definition at line 12562 of file SolveLogOuterClass.java.

◆ addPointMetadata() [4/4]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addPointMetadata ( operations_research.pdlp.SolveLogOuterClass.PointMetadata.Builder builderForValue)
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Definition at line 12603 of file SolveLogOuterClass.java.

◆ addPointMetadataBuilder() [1/2]

operations_research.pdlp.SolveLogOuterClass.PointMetadata.Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addPointMetadataBuilder ( )
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Definition at line 12732 of file SolveLogOuterClass.java.

◆ addPointMetadataBuilder() [2/2]

operations_research.pdlp.SolveLogOuterClass.PointMetadata.Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addPointMetadataBuilder ( int index)
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Definition at line 12743 of file SolveLogOuterClass.java.

◆ addRepeatedField()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.addRepeatedField ( com.google.protobuf.Descriptors.FieldDescriptor field,
java.lang.Object value )

Definition at line 11458 of file SolveLogOuterClass.java.

◆ build()

operations_research.pdlp.SolveLogOuterClass.IterationStats operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.build ( )

Definition at line 11350 of file SolveLogOuterClass.java.

◆ buildPartial()

operations_research.pdlp.SolveLogOuterClass.IterationStats operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.buildPartial ( )

Definition at line 11359 of file SolveLogOuterClass.java.

◆ clear()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.clear ( )

Definition at line 11304 of file SolveLogOuterClass.java.

◆ clearConvergenceInformation()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.clearConvergenceInformation ( )
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;

Definition at line 11984 of file SolveLogOuterClass.java.

◆ clearCumulativeKktMatrixPasses()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.clearCumulativeKktMatrixPasses ( )
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;

Returns
This builder for chaining.

Definition at line 12855 of file SolveLogOuterClass.java.

◆ clearCumulativeRejectedSteps()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.clearCumulativeRejectedSteps ( )
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;

Returns
This builder for chaining.

Definition at line 12915 of file SolveLogOuterClass.java.

◆ clearCumulativeTimeSec()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.clearCumulativeTimeSec ( )
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;

Returns
This builder for chaining.

Definition at line 12975 of file SolveLogOuterClass.java.

◆ clearField()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.clearField ( com.google.protobuf.Descriptors.FieldDescriptor field)

Definition at line 11442 of file SolveLogOuterClass.java.

◆ clearInfeasibilityInformation()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.clearInfeasibilityInformation ( )
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;

Definition at line 12332 of file SolveLogOuterClass.java.

◆ clearIterationNumber()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.clearIterationNumber ( )
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;

Returns
This builder for chaining.

Definition at line 11759 of file SolveLogOuterClass.java.

◆ clearOneof()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.clearOneof ( com.google.protobuf.Descriptors.OneofDescriptor oneof)

Definition at line 11447 of file SolveLogOuterClass.java.

◆ clearPointMetadata()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.clearPointMetadata ( )
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Definition at line 12658 of file SolveLogOuterClass.java.

◆ clearPrimalWeight()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.clearPrimalWeight ( )
Primal weight controlling the relation between primal and dual step sizes.
See field 'step_size' for a detailed description.

optional double primal_weight = 9;

Returns
This builder for chaining.

Definition at line 13161 of file SolveLogOuterClass.java.

◆ clearRestartUsed()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.clearRestartUsed ( )
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;

Returns
This builder for chaining.

Definition at line 13037 of file SolveLogOuterClass.java.

◆ clearStepSize()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.clearStepSize ( )
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;

Returns
This builder for chaining.

Definition at line 13101 of file SolveLogOuterClass.java.

◆ clone()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.clone ( )

Definition at line 11432 of file SolveLogOuterClass.java.

◆ getConvergenceInformation()

operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 11819 of file SolveLogOuterClass.java.

◆ getConvergenceInformationBuilder()

operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation.Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.getConvergenceInformationBuilder ( 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;

Definition at line 12022 of file SolveLogOuterClass.java.

◆ getConvergenceInformationBuilderList()

java.util.List< operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation.Builder > operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.getConvergenceInformationBuilderList ( )
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;

Definition at line 12096 of file SolveLogOuterClass.java.

◆ getConvergenceInformationCount()

int operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 11803 of file SolveLogOuterClass.java.

◆ getConvergenceInformationList()

java.util.List< operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation > operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 11787 of file SolveLogOuterClass.java.

◆ getConvergenceInformationOrBuilder()

operations_research.pdlp.SolveLogOuterClass.ConvergenceInformationOrBuilder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12035 of file SolveLogOuterClass.java.

◆ getConvergenceInformationOrBuilderList()

java.util.List<? extends operations_research.pdlp.SolveLogOuterClass.ConvergenceInformationOrBuilder > operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12052 of file SolveLogOuterClass.java.

◆ getCumulativeKktMatrixPasses()

double operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Returns
The cumulativeKktMatrixPasses.

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12812 of file SolveLogOuterClass.java.

◆ getCumulativeRejectedSteps()

int operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Returns
The cumulativeRejectedSteps.

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12886 of file SolveLogOuterClass.java.

◆ getCumulativeTimeSec()

double operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Returns
The cumulativeTimeSec.

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12946 of file SolveLogOuterClass.java.

◆ getDefaultInstanceForType()

operations_research.pdlp.SolveLogOuterClass.IterationStats operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.getDefaultInstanceForType ( )

Definition at line 11345 of file SolveLogOuterClass.java.

◆ getDescriptor()

static final com.google.protobuf.Descriptors.Descriptor operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.getDescriptor ( )
static

Definition at line 11281 of file SolveLogOuterClass.java.

◆ getDescriptorForType()

com.google.protobuf.Descriptors.Descriptor operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.getDescriptorForType ( )

Definition at line 11340 of file SolveLogOuterClass.java.

◆ getInfeasibilityInformation()

operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12167 of file SolveLogOuterClass.java.

◆ getInfeasibilityInformationBuilder()

operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.getInfeasibilityInformationBuilder ( 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;

Definition at line 12370 of file SolveLogOuterClass.java.

◆ getInfeasibilityInformationBuilderList()

java.util.List< operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder > operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.getInfeasibilityInformationBuilderList ( )
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;

Definition at line 12444 of file SolveLogOuterClass.java.

◆ getInfeasibilityInformationCount()

int operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12151 of file SolveLogOuterClass.java.

◆ getInfeasibilityInformationList()

java.util.List< operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation > operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12135 of file SolveLogOuterClass.java.

◆ getInfeasibilityInformationOrBuilder()

operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuilder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12383 of file SolveLogOuterClass.java.

◆ getInfeasibilityInformationOrBuilderList()

java.util.List<? extends operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformationOrBuilder > operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12400 of file SolveLogOuterClass.java.

◆ getIterationNumber()

int operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Returns
The iterationNumber.

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 11726 of file SolveLogOuterClass.java.

◆ getPointMetadata()

operations_research.pdlp.SolveLogOuterClass.PointMetadata operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.getPointMetadata ( int index)
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12509 of file SolveLogOuterClass.java.

◆ getPointMetadataBuilder()

operations_research.pdlp.SolveLogOuterClass.PointMetadata.Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.getPointMetadataBuilder ( int index)
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Definition at line 12692 of file SolveLogOuterClass.java.

◆ getPointMetadataBuilderList()

java.util.List< operations_research.pdlp.SolveLogOuterClass.PointMetadata.Builder > operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.getPointMetadataBuilderList ( )
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Definition at line 12756 of file SolveLogOuterClass.java.

◆ getPointMetadataCount()

int operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.getPointMetadataCount ( )
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12495 of file SolveLogOuterClass.java.

◆ getPointMetadataList()

java.util.List< operations_research.pdlp.SolveLogOuterClass.PointMetadata > operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.getPointMetadataList ( )
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12481 of file SolveLogOuterClass.java.

◆ getPointMetadataOrBuilder()

operations_research.pdlp.SolveLogOuterClass.PointMetadataOrBuilder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.getPointMetadataOrBuilder ( int index)
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12703 of file SolveLogOuterClass.java.

◆ getPointMetadataOrBuilderList()

java.util.List<? extends operations_research.pdlp.SolveLogOuterClass.PointMetadataOrBuilder > operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.getPointMetadataOrBuilderList ( )
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12718 of file SolveLogOuterClass.java.

◆ getPrimalWeight()

double operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Returns
The primalWeight.

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 13132 of file SolveLogOuterClass.java.

◆ getRestartUsed()

operations_research.pdlp.SolveLogOuterClass.RestartChoice operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Returns
The restartUsed.

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 13005 of file SolveLogOuterClass.java.

◆ getStepSize()

double operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Returns
The stepSize.

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 13070 of file SolveLogOuterClass.java.

◆ hasCumulativeKktMatrixPasses()

boolean operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Returns
Whether the cumulativeKktMatrixPasses field is set.

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12792 of file SolveLogOuterClass.java.

◆ hasCumulativeRejectedSteps()

boolean operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Returns
Whether the cumulativeRejectedSteps field is set.

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12873 of file SolveLogOuterClass.java.

◆ hasCumulativeTimeSec()

boolean operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Returns
Whether the cumulativeTimeSec field is set.

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12933 of file SolveLogOuterClass.java.

◆ hasIterationNumber()

boolean operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Returns
Whether the iterationNumber field is set.

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 11711 of file SolveLogOuterClass.java.

◆ hasPrimalWeight()

boolean operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Returns
Whether the primalWeight field is set.

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 13119 of file SolveLogOuterClass.java.

◆ hasRestartUsed()

boolean operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Returns
Whether the restartUsed field is set.

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 12992 of file SolveLogOuterClass.java.

◆ hasStepSize()

boolean operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.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;

Returns
Whether the stepSize field is set.

Implements operations_research.pdlp.SolveLogOuterClass.IterationStatsOrBuilder.

Definition at line 13056 of file SolveLogOuterClass.java.

◆ internalGetFieldAccessorTable()

com.google.protobuf.GeneratedMessageV3.FieldAccessorTable operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.internalGetFieldAccessorTable ( )
protected

Definition at line 11287 of file SolveLogOuterClass.java.

◆ isInitialized()

final boolean operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.isInitialized ( )

Definition at line 11580 of file SolveLogOuterClass.java.

◆ mergeFrom() [1/3]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.mergeFrom ( com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry ) throws java.io.IOException

Definition at line 11585 of file SolveLogOuterClass.java.

◆ mergeFrom() [2/3]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.mergeFrom ( com.google.protobuf.Message other)

Definition at line 11464 of file SolveLogOuterClass.java.

◆ mergeFrom() [3/3]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.mergeFrom ( operations_research.pdlp.SolveLogOuterClass.IterationStats other)

Definition at line 11473 of file SolveLogOuterClass.java.

◆ mergeUnknownFields()

final Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.mergeUnknownFields ( final com.google.protobuf.UnknownFieldSet unknownFields)

Definition at line 13174 of file SolveLogOuterClass.java.

◆ removeConvergenceInformation()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.removeConvergenceInformation ( 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;

Definition at line 12003 of file SolveLogOuterClass.java.

◆ removeInfeasibilityInformation()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.removeInfeasibilityInformation ( 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;

Definition at line 12351 of file SolveLogOuterClass.java.

◆ removePointMetadata()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.removePointMetadata ( int index)
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Definition at line 12675 of file SolveLogOuterClass.java.

◆ setConvergenceInformation() [1/2]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.setConvergenceInformation ( int index,
operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation value )
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;

Definition at line 11835 of file SolveLogOuterClass.java.

◆ setConvergenceInformation() [2/2]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.setConvergenceInformation ( int index,
operations_research.pdlp.SolveLogOuterClass.ConvergenceInformation.Builder builderForValue )
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;

Definition at line 11858 of file SolveLogOuterClass.java.

◆ setCumulativeKktMatrixPasses()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.setCumulativeKktMatrixPasses ( double value)
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;

Parameters
valueThe cumulativeKktMatrixPasses to set.
Returns
This builder for chaining.

Definition at line 12832 of file SolveLogOuterClass.java.

◆ setCumulativeRejectedSteps()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.setCumulativeRejectedSteps ( int value)
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;

Parameters
valueThe cumulativeRejectedSteps to set.
Returns
This builder for chaining.

Definition at line 12899 of file SolveLogOuterClass.java.

◆ setCumulativeTimeSec()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.setCumulativeTimeSec ( double value)
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;

Parameters
valueThe cumulativeTimeSec to set.
Returns
This builder for chaining.

Definition at line 12959 of file SolveLogOuterClass.java.

◆ setField()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.setField ( com.google.protobuf.Descriptors.FieldDescriptor field,
java.lang.Object value )

Definition at line 11436 of file SolveLogOuterClass.java.

◆ setInfeasibilityInformation() [1/2]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.setInfeasibilityInformation ( int index,
operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation value )
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;

Definition at line 12183 of file SolveLogOuterClass.java.

◆ setInfeasibilityInformation() [2/2]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.setInfeasibilityInformation ( int index,
operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder builderForValue )
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;

Definition at line 12206 of file SolveLogOuterClass.java.

◆ setIterationNumber()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.setIterationNumber ( int value)
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;

Parameters
valueThe iterationNumber to set.
Returns
This builder for chaining.

Definition at line 11741 of file SolveLogOuterClass.java.

◆ setPointMetadata() [1/2]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.setPointMetadata ( int index,
operations_research.pdlp.SolveLogOuterClass.PointMetadata value )
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Definition at line 12523 of file SolveLogOuterClass.java.

◆ setPointMetadata() [2/2]

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.setPointMetadata ( int index,
operations_research.pdlp.SolveLogOuterClass.PointMetadata.Builder builderForValue )
Auxiliary statistics for each type of point.

repeated .operations_research.pdlp.PointMetadata point_metadata = 11;

Definition at line 12544 of file SolveLogOuterClass.java.

◆ setPrimalWeight()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.setPrimalWeight ( double value)
Primal weight controlling the relation between primal and dual step sizes.
See field 'step_size' for a detailed description.

optional double primal_weight = 9;

Parameters
valueThe primalWeight to set.
Returns
This builder for chaining.

Definition at line 13145 of file SolveLogOuterClass.java.

◆ setRepeatedField()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.setRepeatedField ( com.google.protobuf.Descriptors.FieldDescriptor field,
int index,
java.lang.Object value )

Definition at line 11452 of file SolveLogOuterClass.java.

◆ setRestartUsed()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.setRestartUsed ( operations_research.pdlp.SolveLogOuterClass.RestartChoice value)
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;

Parameters
valueThe restartUsed to set.
Returns
This builder for chaining.

Definition at line 13019 of file SolveLogOuterClass.java.

◆ setStepSize()

Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.setStepSize ( double value)
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;

Parameters
valueThe stepSize to set.
Returns
This builder for chaining.

Definition at line 13084 of file SolveLogOuterClass.java.

◆ setUnknownFields()

final Builder operations_research.pdlp.SolveLogOuterClass.IterationStats.Builder.setUnknownFields ( final com.google.protobuf.UnknownFieldSet unknownFields)

Definition at line 13168 of file SolveLogOuterClass.java.


The documentation for this class was generated from the following file: