Uses of Class
operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder

Packages that use SolveLogOuterClass.InfeasibilityInformation.Builder

Package	Description
operations_research.pdlp

Uses of SolveLogOuterClass.InfeasibilityInformation.Builder in operations_research.pdlp

Methods in operations_research.pdlp that return SolveLogOuterClass.InfeasibilityInformation.Builder

Modifier and Type	Method	Description
SolveLogOuterClass.InfeasibilityInformation.Builder	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).
SolveLogOuterClass.InfeasibilityInformation.Builder	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).
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.addRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field, Object value)
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.clear()
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.clearCandidateType()	Type of the point used to compute the InfeasibilityInformation.
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.clearDualRayObjective()	The objective of the linear program labeled (1) in the previous paragraph.
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.clearField(com.google.protobuf.Descriptors.FieldDescriptor field)
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.clearMaxDualRayInfeasibility()	Let (y_ray, r_ray) be the algorithm's estimate of the dual and reduced cost extreme ray where (y_ray, r_ray) is a vector (satisfying the dual variable constraints) scaled such that its infinity norm is one.
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.clearMaxPrimalRayInfeasibility()	Let x_ray be the algorithm's estimate of the primal extreme ray where x_ray is a vector that satisfies the sign constraints for a ray, scaled such that its infinity norm is one (the sign constraints are the variable bound constraints, with all finite bounds mapped to zero).
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.clearOneof(com.google.protobuf.Descriptors.OneofDescriptor oneof)
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.clearPrimalRayLinearObjective()	The value of the linear part of the primal objective (ignoring additive constants) evaluated at x_ray, i.e., c' * x_ray where c is the objective coefficient vector.
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.clearPrimalRayQuadraticNorm()	The l_∞ norm of the vector resulting from taking the quadratic matrix from primal objective and multiplying it by the primal variables.
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.clone()
SolveLogOuterClass.InfeasibilityInformation.Builder	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).
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry)
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.mergeFrom(com.google.protobuf.Message other)
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.mergeFrom(SolveLogOuterClass.InfeasibilityInformation other)
final SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.mergeUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields)
static SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.newBuilder()
static SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.newBuilder(SolveLogOuterClass.InfeasibilityInformation prototype)
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.newBuilderForType()
protected SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.newBuilderForType(com.google.protobuf.GeneratedMessageV3.BuilderParent parent)
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.setCandidateType(SolveLogOuterClass.PointType value)	Type of the point used to compute the InfeasibilityInformation.
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.setDualRayObjective(double value)	The objective of the linear program labeled (1) in the previous paragraph.
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.setField(com.google.protobuf.Descriptors.FieldDescriptor field, Object value)
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.setMaxDualRayInfeasibility(double value)	Let (y_ray, r_ray) be the algorithm's estimate of the dual and reduced cost extreme ray where (y_ray, r_ray) is a vector (satisfying the dual variable constraints) scaled such that its infinity norm is one.
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.setMaxPrimalRayInfeasibility(double value)	Let x_ray be the algorithm's estimate of the primal extreme ray where x_ray is a vector that satisfies the sign constraints for a ray, scaled such that its infinity norm is one (the sign constraints are the variable bound constraints, with all finite bounds mapped to zero).
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.setPrimalRayLinearObjective(double value)	The value of the linear part of the primal objective (ignoring additive constants) evaluated at x_ray, i.e., c' * x_ray where c is the objective coefficient vector.
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.setPrimalRayQuadraticNorm(double value)	The l_∞ norm of the vector resulting from taking the quadratic matrix from primal objective and multiplying it by the primal variables.
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.setRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field, int index, Object value)
final SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.Builder.setUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields)
SolveLogOuterClass.InfeasibilityInformation.Builder	SolveLogOuterClass.InfeasibilityInformation.toBuilder()

Methods in operations_research.pdlp that return types with arguments of type SolveLogOuterClass.InfeasibilityInformation.Builder

Modifier and Type	Method	Description
List<SolveLogOuterClass.InfeasibilityInformation.Builder>	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).

Methods in operations_research.pdlp with parameters of type SolveLogOuterClass.InfeasibilityInformation.Builder

Modifier and Type	Method	Description
SolveLogOuterClass.IterationStats.Builder	SolveLogOuterClass.IterationStats.Builder.addInfeasibilityInformation(int index, 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).
SolveLogOuterClass.IterationStats.Builder	SolveLogOuterClass.IterationStats.Builder.addInfeasibilityInformation(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).
SolveLogOuterClass.IterationStats.Builder	SolveLogOuterClass.IterationStats.Builder.setInfeasibilityInformation(int index, 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).