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
Modifier and Type | Method and Description |
---|---|
IterationStats.Builder |
addAllConvergenceInformation(java.lang.Iterable<? extends ConvergenceInformation> values)
A set of statistics measuring how close a point is to establishing primal
and dual feasibility and optimality.
|
IterationStats.Builder |
addAllInfeasibilityInformation(java.lang.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).
|
IterationStats.Builder |
addAllPointMetadata(java.lang.Iterable<? extends PointMetadata> values)
Auxiliary statistics for each type of point.
|
IterationStats.Builder |
addConvergenceInformation(ConvergenceInformation.Builder builderForValue)
A set of statistics measuring how close a point is to establishing primal
and dual feasibility and optimality.
|
IterationStats.Builder |
addConvergenceInformation(ConvergenceInformation value)
A set of statistics measuring how close a point is to establishing primal
and dual feasibility and optimality.
|
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.
|
IterationStats.Builder |
addConvergenceInformation(int index,
ConvergenceInformation value)
A set of statistics measuring how close a point is to establishing primal
and dual feasibility and optimality.
|
ConvergenceInformation.Builder |
addConvergenceInformationBuilder()
A set of statistics measuring how close a point is to establishing primal
and dual feasibility and optimality.
|
ConvergenceInformation.Builder |
addConvergenceInformationBuilder(int index)
A set of statistics measuring how close a point is to establishing primal
and dual feasibility and optimality.
|
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).
|
IterationStats.Builder |
addInfeasibilityInformation(InfeasibilityInformation value)
A set of statistics measuring how close a point is to establishing primal
or dual infeasibility (i.e., has no solution).
|
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).
|
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).
|
InfeasibilityInformation.Builder |
addInfeasibilityInformationBuilder()
A set of statistics measuring how close a point is to establishing primal
or dual infeasibility (i.e., has no solution).
|
InfeasibilityInformation.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).
|
IterationStats.Builder |
addPointMetadata(int index,
PointMetadata.Builder builderForValue)
Auxiliary statistics for each type of point.
|
IterationStats.Builder |
addPointMetadata(int index,
PointMetadata value)
Auxiliary statistics for each type of point.
|
IterationStats.Builder |
addPointMetadata(PointMetadata.Builder builderForValue)
Auxiliary statistics for each type of point.
|
IterationStats.Builder |
addPointMetadata(PointMetadata value)
Auxiliary statistics for each type of point.
|
PointMetadata.Builder |
addPointMetadataBuilder()
Auxiliary statistics for each type of point.
|
PointMetadata.Builder |
addPointMetadataBuilder(int index)
Auxiliary statistics for each type of point.
|
IterationStats |
build() |
IterationStats |
buildPartial() |
IterationStats.Builder |
clear() |
IterationStats.Builder |
clearConvergenceInformation()
A set of statistics measuring how close a point is to establishing primal
and dual feasibility and optimality.
|
IterationStats.Builder |
clearCumulativeKktMatrixPasses()
The cumulative number of passes through the KKT matrix since the start of
the solve.
|
IterationStats.Builder |
clearCumulativeRejectedSteps()
The total number of rejected steps (e.g., within a line search procedure)
since the start of the solve.
|
IterationStats.Builder |
clearCumulativeTimeSec()
The amount of time passed since we started solving the problem (see solver
log `solve_time_sec` which records total time).
|
IterationStats.Builder |
clearInfeasibilityInformation()
A set of statistics measuring how close a point is to establishing primal
or dual infeasibility (i.e., has no solution).
|
IterationStats.Builder |
clearIterationNumber()
The iteration number at which these stats were recorded.
|
IterationStats.Builder |
clearPointMetadata()
Auxiliary statistics for each type of point.
|
IterationStats.Builder |
clearPrimalWeight()
Primal weight controlling the relation between primal and dual step sizes.
|
IterationStats.Builder |
clearRestartUsed()
The kind of restart that occurred at this iteration, or NO_RESTART if a
restart did not occur.
|
IterationStats.Builder |
clearStepSize()
Step size used at this iteration.
|
ConvergenceInformation |
getConvergenceInformation(int index)
A set of statistics measuring how close a point is to establishing primal
and dual feasibility and optimality.
|
ConvergenceInformation.Builder |
getConvergenceInformationBuilder(int index)
A set of statistics measuring how close a point is to establishing primal
and dual feasibility and optimality.
|
java.util.List<ConvergenceInformation.Builder> |
getConvergenceInformationBuilderList()
A set of statistics measuring how close a point is to establishing primal
and dual feasibility and optimality.
|
int |
getConvergenceInformationCount()
A set of statistics measuring how close a point is to establishing primal
and dual feasibility and optimality.
|
java.util.List<ConvergenceInformation> |
getConvergenceInformationList()
A set of statistics measuring how close a point is to establishing primal
and dual feasibility and optimality.
|
ConvergenceInformationOrBuilder |
getConvergenceInformationOrBuilder(int index)
A set of statistics measuring how close a point is to establishing primal
and dual feasibility and optimality.
|
java.util.List<? extends ConvergenceInformationOrBuilder> |
getConvergenceInformationOrBuilderList()
A set of statistics measuring how close a point is to establishing primal
and dual feasibility and optimality.
|
double |
getCumulativeKktMatrixPasses()
The cumulative number of passes through the KKT matrix since the start of
the solve.
|
int |
getCumulativeRejectedSteps()
The total number of rejected steps (e.g., within a line search procedure)
since the start of the solve.
|
double |
getCumulativeTimeSec()
The amount of time passed since we started solving the problem (see solver
log `solve_time_sec` which records total time).
|
IterationStats |
getDefaultInstanceForType() |
static com.google.protobuf.Descriptors.Descriptor |
getDescriptor() |
com.google.protobuf.Descriptors.Descriptor |
getDescriptorForType() |
InfeasibilityInformation |
getInfeasibilityInformation(int index)
A set of statistics measuring how close a point is to establishing primal
or dual infeasibility (i.e., has no solution).
|
InfeasibilityInformation.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).
|
java.util.List<InfeasibilityInformation.Builder> |
getInfeasibilityInformationBuilderList()
A set of statistics measuring how close a point is to establishing primal
or dual infeasibility (i.e., has no solution).
|
int |
getInfeasibilityInformationCount()
A set of statistics measuring how close a point is to establishing primal
or dual infeasibility (i.e., has no solution).
|
java.util.List<InfeasibilityInformation> |
getInfeasibilityInformationList()
A set of statistics measuring how close a point is to establishing primal
or dual infeasibility (i.e., has no solution).
|
InfeasibilityInformationOrBuilder |
getInfeasibilityInformationOrBuilder(int index)
A set of statistics measuring how close a point is to establishing primal
or dual infeasibility (i.e., has no solution).
|
java.util.List<? extends InfeasibilityInformationOrBuilder> |
getInfeasibilityInformationOrBuilderList()
A set of statistics measuring how close a point is to establishing primal
or dual infeasibility (i.e., has no solution).
|
int |
getIterationNumber()
The iteration number at which these stats were recorded.
|
PointMetadata |
getPointMetadata(int index)
Auxiliary statistics for each type of point.
|
PointMetadata.Builder |
getPointMetadataBuilder(int index)
Auxiliary statistics for each type of point.
|
java.util.List<PointMetadata.Builder> |
getPointMetadataBuilderList()
Auxiliary statistics for each type of point.
|
int |
getPointMetadataCount()
Auxiliary statistics for each type of point.
|
java.util.List<PointMetadata> |
getPointMetadataList()
Auxiliary statistics for each type of point.
|
PointMetadataOrBuilder |
getPointMetadataOrBuilder(int index)
Auxiliary statistics for each type of point.
|
java.util.List<? extends PointMetadataOrBuilder> |
getPointMetadataOrBuilderList()
Auxiliary statistics for each type of point.
|
double |
getPrimalWeight()
Primal weight controlling the relation between primal and dual step sizes.
|
RestartChoice |
getRestartUsed()
The kind of restart that occurred at this iteration, or NO_RESTART if a
restart did not occur.
|
double |
getStepSize()
Step size used at this iteration.
|
boolean |
hasCumulativeKktMatrixPasses()
The cumulative number of passes through the KKT matrix since the start of
the solve.
|
boolean |
hasCumulativeRejectedSteps()
The total number of rejected steps (e.g., within a line search procedure)
since the start of the solve.
|
boolean |
hasCumulativeTimeSec()
The amount of time passed since we started solving the problem (see solver
log `solve_time_sec` which records total time).
|
boolean |
hasIterationNumber()
The iteration number at which these stats were recorded.
|
boolean |
hasPrimalWeight()
Primal weight controlling the relation between primal and dual step sizes.
|
boolean |
hasRestartUsed()
The kind of restart that occurred at this iteration, or NO_RESTART if a
restart did not occur.
|
boolean |
hasStepSize()
Step size used at this iteration.
|
protected com.google.protobuf.GeneratedMessage.FieldAccessorTable |
internalGetFieldAccessorTable() |
boolean |
isInitialized() |
IterationStats.Builder |
mergeFrom(com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry) |
IterationStats.Builder |
mergeFrom(IterationStats other) |
IterationStats.Builder |
mergeFrom(com.google.protobuf.Message other) |
IterationStats.Builder |
removeConvergenceInformation(int index)
A set of statistics measuring how close a point is to establishing primal
and dual feasibility and optimality.
|
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).
|
IterationStats.Builder |
removePointMetadata(int index)
Auxiliary statistics for each type of point.
|
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.
|
IterationStats.Builder |
setConvergenceInformation(int index,
ConvergenceInformation value)
A set of statistics measuring how close a point is to establishing primal
and dual feasibility and optimality.
|
IterationStats.Builder |
setCumulativeKktMatrixPasses(double value)
The cumulative number of passes through the KKT matrix since the start of
the solve.
|
IterationStats.Builder |
setCumulativeRejectedSteps(int value)
The total number of rejected steps (e.g., within a line search procedure)
since the start of the solve.
|
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).
|
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).
|
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).
|
IterationStats.Builder |
setIterationNumber(int value)
The iteration number at which these stats were recorded.
|
IterationStats.Builder |
setPointMetadata(int index,
PointMetadata.Builder builderForValue)
Auxiliary statistics for each type of point.
|
IterationStats.Builder |
setPointMetadata(int index,
PointMetadata value)
Auxiliary statistics for each type of point.
|
IterationStats.Builder |
setPrimalWeight(double value)
Primal weight controlling the relation between primal and dual step sizes.
|
IterationStats.Builder |
setRestartUsed(RestartChoice value)
The kind of restart that occurred at this iteration, or NO_RESTART if a
restart did not occur.
|
IterationStats.Builder |
setStepSize(double value)
Step size used at this iteration.
|
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, setUnknownFieldsProto3
findInitializationErrors, getInitializationErrorString, internalMergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, newUninitializedMessageException, toString
addAll, addAll, mergeDelimitedFrom, mergeDelimitedFrom, newUninitializedMessageException
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
public static final com.google.protobuf.Descriptors.Descriptor getDescriptor()
protected com.google.protobuf.GeneratedMessage.FieldAccessorTable internalGetFieldAccessorTable()
internalGetFieldAccessorTable
in class com.google.protobuf.GeneratedMessage.Builder<IterationStats.Builder>
public IterationStats.Builder clear()
clear
in interface com.google.protobuf.Message.Builder
clear
in interface com.google.protobuf.MessageLite.Builder
clear
in class com.google.protobuf.GeneratedMessage.Builder<IterationStats.Builder>
public com.google.protobuf.Descriptors.Descriptor getDescriptorForType()
getDescriptorForType
in interface com.google.protobuf.Message.Builder
getDescriptorForType
in interface com.google.protobuf.MessageOrBuilder
getDescriptorForType
in class com.google.protobuf.GeneratedMessage.Builder<IterationStats.Builder>
public IterationStats getDefaultInstanceForType()
getDefaultInstanceForType
in interface com.google.protobuf.MessageLiteOrBuilder
getDefaultInstanceForType
in interface com.google.protobuf.MessageOrBuilder
public IterationStats build()
build
in interface com.google.protobuf.Message.Builder
build
in interface com.google.protobuf.MessageLite.Builder
public IterationStats buildPartial()
buildPartial
in interface com.google.protobuf.Message.Builder
buildPartial
in interface com.google.protobuf.MessageLite.Builder
public IterationStats.Builder mergeFrom(com.google.protobuf.Message other)
mergeFrom
in interface com.google.protobuf.Message.Builder
mergeFrom
in class com.google.protobuf.AbstractMessage.Builder<IterationStats.Builder>
public IterationStats.Builder mergeFrom(IterationStats other)
public final boolean isInitialized()
isInitialized
in interface com.google.protobuf.MessageLiteOrBuilder
isInitialized
in class com.google.protobuf.GeneratedMessage.Builder<IterationStats.Builder>
public IterationStats.Builder mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException
mergeFrom
in interface com.google.protobuf.Message.Builder
mergeFrom
in interface com.google.protobuf.MessageLite.Builder
mergeFrom
in class com.google.protobuf.AbstractMessage.Builder<IterationStats.Builder>
java.io.IOException
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;
hasIterationNumber
in interface IterationStatsOrBuilder
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;
getIterationNumber
in interface IterationStatsOrBuilder
public 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;
value
- The iterationNumber to set.public 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;
public java.util.List<ConvergenceInformation> 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;
getConvergenceInformationList
in interface IterationStatsOrBuilder
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;
getConvergenceInformationCount
in interface IterationStatsOrBuilder
public ConvergenceInformation 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;
getConvergenceInformation
in interface IterationStatsOrBuilder
public IterationStats.Builder setConvergenceInformation(int index, 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;
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;
public IterationStats.Builder addConvergenceInformation(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;
public IterationStats.Builder addConvergenceInformation(int index, 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;
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;
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;
public IterationStats.Builder addAllConvergenceInformation(java.lang.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;
public 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;
public 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;
public ConvergenceInformation.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;
public ConvergenceInformationOrBuilder 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;
getConvergenceInformationOrBuilder
in interface IterationStatsOrBuilder
public java.util.List<? extends ConvergenceInformationOrBuilder> 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;
getConvergenceInformationOrBuilderList
in interface IterationStatsOrBuilder
public ConvergenceInformation.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;
public ConvergenceInformation.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;
public java.util.List<ConvergenceInformation.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;
public java.util.List<InfeasibilityInformation> 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;
getInfeasibilityInformationList
in interface IterationStatsOrBuilder
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;
getInfeasibilityInformationCount
in interface IterationStatsOrBuilder
public InfeasibilityInformation 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;
getInfeasibilityInformation
in interface IterationStatsOrBuilder
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;
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;
public IterationStats.Builder addInfeasibilityInformation(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;
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;
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;
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;
public IterationStats.Builder addAllInfeasibilityInformation(java.lang.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;
public 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;
public 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;
public InfeasibilityInformation.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;
public InfeasibilityInformationOrBuilder 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;
getInfeasibilityInformationOrBuilder
in interface IterationStatsOrBuilder
public java.util.List<? extends InfeasibilityInformationOrBuilder> 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;
getInfeasibilityInformationOrBuilderList
in interface IterationStatsOrBuilder
public InfeasibilityInformation.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;
public InfeasibilityInformation.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;
public java.util.List<InfeasibilityInformation.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;
public java.util.List<PointMetadata> getPointMetadataList()
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
getPointMetadataList
in interface IterationStatsOrBuilder
public int getPointMetadataCount()
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
getPointMetadataCount
in interface IterationStatsOrBuilder
public PointMetadata getPointMetadata(int index)
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
getPointMetadata
in interface IterationStatsOrBuilder
public IterationStats.Builder setPointMetadata(int index, PointMetadata value)
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
public IterationStats.Builder setPointMetadata(int index, PointMetadata.Builder builderForValue)
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
public IterationStats.Builder addPointMetadata(PointMetadata value)
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
public IterationStats.Builder addPointMetadata(int index, PointMetadata value)
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
public IterationStats.Builder addPointMetadata(PointMetadata.Builder builderForValue)
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
public IterationStats.Builder addPointMetadata(int index, PointMetadata.Builder builderForValue)
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
public IterationStats.Builder addAllPointMetadata(java.lang.Iterable<? extends PointMetadata> values)
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
public IterationStats.Builder clearPointMetadata()
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
public IterationStats.Builder removePointMetadata(int index)
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
public PointMetadata.Builder getPointMetadataBuilder(int index)
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
public PointMetadataOrBuilder getPointMetadataOrBuilder(int index)
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
getPointMetadataOrBuilder
in interface IterationStatsOrBuilder
public java.util.List<? extends PointMetadataOrBuilder> getPointMetadataOrBuilderList()
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
getPointMetadataOrBuilderList
in interface IterationStatsOrBuilder
public PointMetadata.Builder addPointMetadataBuilder()
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
public PointMetadata.Builder addPointMetadataBuilder(int index)
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
public java.util.List<PointMetadata.Builder> getPointMetadataBuilderList()
Auxiliary statistics for each type of point.
repeated .operations_research.pdlp.PointMetadata point_metadata = 11;
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;
hasCumulativeKktMatrixPasses
in interface IterationStatsOrBuilder
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;
getCumulativeKktMatrixPasses
in interface IterationStatsOrBuilder
public 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;
value
- The cumulativeKktMatrixPasses to set.public 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;
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;
hasCumulativeRejectedSteps
in interface IterationStatsOrBuilder
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;
getCumulativeRejectedSteps
in interface IterationStatsOrBuilder
public 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;
value
- The cumulativeRejectedSteps to set.public 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;
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;
hasCumulativeTimeSec
in interface IterationStatsOrBuilder
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;
getCumulativeTimeSec
in interface IterationStatsOrBuilder
public 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;
value
- The cumulativeTimeSec to set.public 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;
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;
hasRestartUsed
in interface IterationStatsOrBuilder
public RestartChoice 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;
getRestartUsed
in interface IterationStatsOrBuilder
public IterationStats.Builder setRestartUsed(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;
value
- The restartUsed to set.public 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;
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;
hasStepSize
in interface IterationStatsOrBuilder
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;
getStepSize
in interface IterationStatsOrBuilder
public 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;
value
- The stepSize to set.public 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;
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;
hasPrimalWeight
in interface IterationStatsOrBuilder
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;
getPrimalWeight
in interface IterationStatsOrBuilder
public 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;
value
- The primalWeight to set.public 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;
Copyright © 2025. All rights reserved.