Class IterationStats.Builder
java.lang.Object
com.google.protobuf.AbstractMessageLite.Builder
com.google.protobuf.AbstractMessage.Builder<IterationStats.Builder>
com.google.protobuf.GeneratedMessage.Builder<IterationStats.Builder>
com.google.ortools.pdlp.IterationStats.Builder
- All Implemented Interfaces:
IterationStatsOrBuilder,com.google.protobuf.Message.Builder,com.google.protobuf.MessageLite.Builder,com.google.protobuf.MessageLiteOrBuilder,com.google.protobuf.MessageOrBuilder,Cloneable
- Enclosing class:
IterationStats
public static final class IterationStats.Builder
extends com.google.protobuf.GeneratedMessage.Builder<IterationStats.Builder>
implements IterationStatsOrBuilder
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-
Method Summary
Modifier and TypeMethodDescriptionaddAllConvergenceInformation(Iterable<? extends ConvergenceInformation> values) A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.addAllInfeasibilityInformation(Iterable<? extends InfeasibilityInformation> values) A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).addAllPointMetadata(Iterable<? extends PointMetadata> values) Auxiliary statistics for each type of point.addConvergenceInformation(int index, ConvergenceInformation value) A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.addConvergenceInformation(int index, ConvergenceInformation.Builder builderForValue) A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.addConvergenceInformation(ConvergenceInformation.Builder builderForValue) A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.addConvergenceInformationBuilder(int index) A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.addInfeasibilityInformation(int index, InfeasibilityInformation value) A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).addInfeasibilityInformation(int index, InfeasibilityInformation.Builder builderForValue) A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).addInfeasibilityInformation(InfeasibilityInformation.Builder builderForValue) A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).addInfeasibilityInformationBuilder(int index) A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).addPointMetadata(int index, PointMetadata value) Auxiliary statistics for each type of point.addPointMetadata(int index, PointMetadata.Builder builderForValue) Auxiliary statistics for each type of point.addPointMetadata(PointMetadata value) Auxiliary statistics for each type of point.addPointMetadata(PointMetadata.Builder builderForValue) Auxiliary statistics for each type of point.Auxiliary statistics for each type of point.addPointMetadataBuilder(int index) Auxiliary statistics for each type of point.build()clear()A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.The cumulative number of passes through the KKT matrix since the start of the solve.The total number of rejected steps (e.g., within a line search procedure) since the start of the solve.The amount of time passed since we started solving the problem (see solver log `solve_time_sec` which records total time).A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).The iteration number at which these stats were recorded.Auxiliary statistics for each type of point.Primal weight controlling the relation between primal and dual step sizes.The kind of restart that occurred at this iteration, or NO_RESTART if a restart did not occur.Step size used at this iteration.getConvergenceInformation(int index) A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.getConvergenceInformationBuilder(int index) A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.intA set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.getConvergenceInformationOrBuilder(int index) A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.List<? extends ConvergenceInformationOrBuilder> A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.doubleThe cumulative number of passes through the KKT matrix since the start of the solve.intThe total number of rejected steps (e.g., within a line search procedure) since the start of the solve.doubleThe amount of time passed since we started solving the problem (see solver log `solve_time_sec` which records total time).static final com.google.protobuf.Descriptors.Descriptorcom.google.protobuf.Descriptors.DescriptorgetInfeasibilityInformation(int index) A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).getInfeasibilityInformationBuilder(int index) A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).intA set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).getInfeasibilityInformationOrBuilder(int index) A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).List<? extends InfeasibilityInformationOrBuilder> A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).intThe iteration number at which these stats were recorded.getPointMetadata(int index) Auxiliary statistics for each type of point.getPointMetadataBuilder(int index) Auxiliary statistics for each type of point.Auxiliary statistics for each type of point.intAuxiliary statistics for each type of point.Auxiliary statistics for each type of point.getPointMetadataOrBuilder(int index) Auxiliary statistics for each type of point.List<? extends PointMetadataOrBuilder> Auxiliary statistics for each type of point.doublePrimal weight controlling the relation between primal and dual step sizes.The kind of restart that occurred at this iteration, or NO_RESTART if a restart did not occur.doubleStep size used at this iteration.booleanThe cumulative number of passes through the KKT matrix since the start of the solve.booleanThe total number of rejected steps (e.g., within a line search procedure) since the start of the solve.booleanThe amount of time passed since we started solving the problem (see solver log `solve_time_sec` which records total time).booleanThe iteration number at which these stats were recorded.booleanPrimal weight controlling the relation between primal and dual step sizes.booleanThe kind of restart that occurred at this iteration, or NO_RESTART if a restart did not occur.booleanStep size used at this iteration.protected com.google.protobuf.GeneratedMessage.FieldAccessorTablefinal booleanmergeFrom(IterationStats other) mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) mergeFrom(com.google.protobuf.Message other) removeConvergenceInformation(int index) A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.removeInfeasibilityInformation(int index) A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).removePointMetadata(int index) Auxiliary statistics for each type of point.setConvergenceInformation(int index, ConvergenceInformation value) A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.setConvergenceInformation(int index, ConvergenceInformation.Builder builderForValue) A set of statistics measuring how close a point is to establishing primal and dual feasibility and optimality.setCumulativeKktMatrixPasses(double value) The cumulative number of passes through the KKT matrix since the start of the solve.setCumulativeRejectedSteps(int value) The total number of rejected steps (e.g., within a line search procedure) since the start of the solve.setCumulativeTimeSec(double value) The amount of time passed since we started solving the problem (see solver log `solve_time_sec` which records total time).setInfeasibilityInformation(int index, InfeasibilityInformation value) A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).setInfeasibilityInformation(int index, InfeasibilityInformation.Builder builderForValue) A set of statistics measuring how close a point is to establishing primal or dual infeasibility (i.e., has no solution).setIterationNumber(int value) The iteration number at which these stats were recorded.setPointMetadata(int index, PointMetadata value) Auxiliary statistics for each type of point.setPointMetadata(int index, PointMetadata.Builder builderForValue) Auxiliary statistics for each type of point.setPrimalWeight(double value) Primal weight controlling the relation between primal and dual step sizes.setRestartUsed(RestartChoice value) The kind of restart that occurred at this iteration, or NO_RESTART if a restart did not occur.setStepSize(double value) Step size used at this iteration.Methods inherited from class com.google.protobuf.GeneratedMessage.Builder
addRepeatedField, clearField, clearOneof, clone, getAllFields, getField, getFieldBuilder, getOneofFieldDescriptor, getParentForChildren, getRepeatedField, getRepeatedFieldBuilder, getRepeatedFieldCount, getUnknownFields, getUnknownFieldSetBuilder, hasField, hasOneof, internalGetMapField, internalGetMapFieldReflection, internalGetMutableMapField, internalGetMutableMapFieldReflection, isClean, markClean, mergeUnknownFields, mergeUnknownLengthDelimitedField, mergeUnknownVarintField, newBuilderForField, onBuilt, onChanged, parseUnknownField, setField, setRepeatedField, setUnknownFields, setUnknownFieldSetBuilder, setUnknownFieldsProto3Methods inherited from class com.google.protobuf.AbstractMessage.Builder
findInitializationErrors, getInitializationErrorString, internalMergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, newUninitializedMessageException, toStringMethods inherited from class com.google.protobuf.AbstractMessageLite.Builder
addAll, addAll, mergeDelimitedFrom, mergeDelimitedFrom, mergeFrom, newUninitializedMessageExceptionMethods inherited from class java.lang.Object
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitMethods inherited from interface com.google.protobuf.Message.Builder
mergeDelimitedFrom, mergeDelimitedFromMethods inherited from interface com.google.protobuf.MessageLite.Builder
mergeFromMethods inherited from interface com.google.protobuf.MessageOrBuilder
findInitializationErrors, getAllFields, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof
-
Method Details
-
getDescriptor
public static final com.google.protobuf.Descriptors.Descriptor getDescriptor() -
internalGetFieldAccessorTable
protected com.google.protobuf.GeneratedMessage.FieldAccessorTable internalGetFieldAccessorTable()- Specified by:
internalGetFieldAccessorTablein classcom.google.protobuf.GeneratedMessage.Builder<IterationStats.Builder>
-
clear
- Specified by:
clearin interfacecom.google.protobuf.Message.Builder- Specified by:
clearin interfacecom.google.protobuf.MessageLite.Builder- Overrides:
clearin classcom.google.protobuf.GeneratedMessage.Builder<IterationStats.Builder>
-
getDescriptorForType
public com.google.protobuf.Descriptors.Descriptor getDescriptorForType()- Specified by:
getDescriptorForTypein interfacecom.google.protobuf.Message.Builder- Specified by:
getDescriptorForTypein interfacecom.google.protobuf.MessageOrBuilder- Overrides:
getDescriptorForTypein classcom.google.protobuf.GeneratedMessage.Builder<IterationStats.Builder>
-
getDefaultInstanceForType
- Specified by:
getDefaultInstanceForTypein interfacecom.google.protobuf.MessageLiteOrBuilder- Specified by:
getDefaultInstanceForTypein interfacecom.google.protobuf.MessageOrBuilder
-
build
- Specified by:
buildin interfacecom.google.protobuf.Message.Builder- Specified by:
buildin interfacecom.google.protobuf.MessageLite.Builder
-
buildPartial
- Specified by:
buildPartialin interfacecom.google.protobuf.Message.Builder- Specified by:
buildPartialin interfacecom.google.protobuf.MessageLite.Builder
-
mergeFrom
- Specified by:
mergeFromin interfacecom.google.protobuf.Message.Builder- Overrides:
mergeFromin classcom.google.protobuf.AbstractMessage.Builder<IterationStats.Builder>
-
mergeFrom
-
isInitialized
public final boolean isInitialized()- Specified by:
isInitializedin interfacecom.google.protobuf.MessageLiteOrBuilder- Overrides:
isInitializedin classcom.google.protobuf.GeneratedMessage.Builder<IterationStats.Builder>
-
mergeFrom
public IterationStats.Builder mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws IOException - Specified by:
mergeFromin interfacecom.google.protobuf.Message.Builder- Specified by:
mergeFromin interfacecom.google.protobuf.MessageLite.Builder- Overrides:
mergeFromin classcom.google.protobuf.AbstractMessage.Builder<IterationStats.Builder>- Throws:
IOException
-
hasIterationNumber
public boolean 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;- Specified by:
hasIterationNumberin interfaceIterationStatsOrBuilder- Returns:
- Whether the iterationNumber field is set.
-
getIterationNumber
public int 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;- Specified by:
getIterationNumberin interfaceIterationStatsOrBuilder- Returns:
- The iterationNumber.
-
setIterationNumber
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:
value- The iterationNumber to set.- Returns:
- This builder for chaining.
-
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.
-
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;- Specified by:
getConvergenceInformationListin interfaceIterationStatsOrBuilder
-
getConvergenceInformationCount
public int 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;- Specified by:
getConvergenceInformationCountin interfaceIterationStatsOrBuilder
-
getConvergenceInformation
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;- Specified by:
getConvergenceInformationin interfaceIterationStatsOrBuilder
-
setConvergenceInformation
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; -
setConvergenceInformation
public IterationStats.Builder setConvergenceInformation(int index, 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; -
addConvergenceInformation
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; -
addConvergenceInformation
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; -
addConvergenceInformation
public IterationStats.Builder addConvergenceInformation(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; -
addConvergenceInformation
public IterationStats.Builder addConvergenceInformation(int index, 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; -
addAllConvergenceInformation
public IterationStats.Builder addAllConvergenceInformation(Iterable<? extends 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; -
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; -
removeConvergenceInformation
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; -
getConvergenceInformationBuilder
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; -
getConvergenceInformationOrBuilder
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;- Specified by:
getConvergenceInformationOrBuilderin interfaceIterationStatsOrBuilder
-
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;- Specified by:
getConvergenceInformationOrBuilderListin interfaceIterationStatsOrBuilder
-
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; -
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; -
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; -
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;- Specified by:
getInfeasibilityInformationListin interfaceIterationStatsOrBuilder
-
getInfeasibilityInformationCount
public int 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;- Specified by:
getInfeasibilityInformationCountin interfaceIterationStatsOrBuilder
-
getInfeasibilityInformation
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;- Specified by:
getInfeasibilityInformationin interfaceIterationStatsOrBuilder
-
setInfeasibilityInformation
public IterationStats.Builder setInfeasibilityInformation(int index, 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; -
setInfeasibilityInformation
public IterationStats.Builder setInfeasibilityInformation(int index, 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; -
addInfeasibilityInformation
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; -
addInfeasibilityInformation
public IterationStats.Builder addInfeasibilityInformation(int index, 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; -
addInfeasibilityInformation
public IterationStats.Builder addInfeasibilityInformation(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; -
addInfeasibilityInformation
public IterationStats.Builder addInfeasibilityInformation(int index, 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; -
addAllInfeasibilityInformation
public IterationStats.Builder addAllInfeasibilityInformation(Iterable<? extends 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; -
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; -
removeInfeasibilityInformation
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; -
getInfeasibilityInformationBuilder
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; -
getInfeasibilityInformationOrBuilder
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;- Specified by:
getInfeasibilityInformationOrBuilderin interfaceIterationStatsOrBuilder
-
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;- Specified by:
getInfeasibilityInformationOrBuilderListin interfaceIterationStatsOrBuilder
-
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; -
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; -
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; -
getPointMetadataList
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;- Specified by:
getPointMetadataListin interfaceIterationStatsOrBuilder
-
getPointMetadataCount
public int getPointMetadataCount()Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;- Specified by:
getPointMetadataCountin interfaceIterationStatsOrBuilder
-
getPointMetadata
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;- Specified by:
getPointMetadatain interfaceIterationStatsOrBuilder
-
setPointMetadata
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11; -
setPointMetadata
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11; -
addPointMetadata
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11; -
addPointMetadata
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11; -
addPointMetadata
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11; -
addPointMetadata
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11; -
addAllPointMetadata
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11; -
clearPointMetadata
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11; -
removePointMetadata
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11; -
getPointMetadataBuilder
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11; -
getPointMetadataOrBuilder
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;- Specified by:
getPointMetadataOrBuilderin interfaceIterationStatsOrBuilder
-
getPointMetadataOrBuilderList
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;- Specified by:
getPointMetadataOrBuilderListin interfaceIterationStatsOrBuilder
-
addPointMetadataBuilder
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11; -
addPointMetadataBuilder
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11; -
getPointMetadataBuilderList
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11; -
hasCumulativeKktMatrixPasses
public boolean 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;- Specified by:
hasCumulativeKktMatrixPassesin interfaceIterationStatsOrBuilder- Returns:
- Whether the cumulativeKktMatrixPasses field is set.
-
getCumulativeKktMatrixPasses
public double 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;- Specified by:
getCumulativeKktMatrixPassesin interfaceIterationStatsOrBuilder- Returns:
- The cumulativeKktMatrixPasses.
-
setCumulativeKktMatrixPasses
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:
value- The cumulativeKktMatrixPasses to set.- Returns:
- This builder for chaining.
-
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.
-
hasCumulativeRejectedSteps
public boolean 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;- Specified by:
hasCumulativeRejectedStepsin interfaceIterationStatsOrBuilder- Returns:
- Whether the cumulativeRejectedSteps field is set.
-
getCumulativeRejectedSteps
public int 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;- Specified by:
getCumulativeRejectedStepsin interfaceIterationStatsOrBuilder- Returns:
- The cumulativeRejectedSteps.
-
setCumulativeRejectedSteps
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:
value- The cumulativeRejectedSteps to set.- Returns:
- This builder for chaining.
-
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.
-
hasCumulativeTimeSec
public boolean 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;- Specified by:
hasCumulativeTimeSecin interfaceIterationStatsOrBuilder- Returns:
- Whether the cumulativeTimeSec field is set.
-
getCumulativeTimeSec
public double 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;- Specified by:
getCumulativeTimeSecin interfaceIterationStatsOrBuilder- Returns:
- The cumulativeTimeSec.
-
setCumulativeTimeSec
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:
value- The cumulativeTimeSec to set.- Returns:
- This builder for chaining.
-
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.
-
hasRestartUsed
public boolean 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;- Specified by:
hasRestartUsedin interfaceIterationStatsOrBuilder- Returns:
- Whether the restartUsed field is set.
-
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;- Specified by:
getRestartUsedin interfaceIterationStatsOrBuilder- Returns:
- The restartUsed.
-
setRestartUsed
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:
value- The restartUsed to set.- Returns:
- This builder for chaining.
-
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.
-
hasStepSize
public boolean 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;- Specified by:
hasStepSizein interfaceIterationStatsOrBuilder- Returns:
- Whether the stepSize field is set.
-
getStepSize
public double 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;- Specified by:
getStepSizein interfaceIterationStatsOrBuilder- Returns:
- The stepSize.
-
setStepSize
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:
value- The stepSize to set.- Returns:
- This builder for chaining.
-
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.
-
hasPrimalWeight
public boolean 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;- Specified by:
hasPrimalWeightin interfaceIterationStatsOrBuilder- Returns:
- Whether the primalWeight field is set.
-
getPrimalWeight
public double 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;- Specified by:
getPrimalWeightin interfaceIterationStatsOrBuilder- Returns:
- The primalWeight.
-
setPrimalWeight
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:
value- The primalWeight to set.- Returns:
- This builder for chaining.
-
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.
-