Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.Builder.addRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field,
java.lang.Object value) |
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.Builder.clear() |
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.Builder.clearField(com.google.protobuf.Descriptors.FieldDescriptor field) |
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.Builder.clearOneof(com.google.protobuf.Descriptors.OneofDescriptor oneof) |
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.Builder.clearStepSizeGrowthExponent() |
The step size growth exponent defines a step size given by (1 +
(total_steps_attempted + 1)^(-step_size_growth_exponent)) * step_size_.
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.Builder.clearStepSizeReductionExponent() |
The step size reduction exponent defines a step size given by
(1 - (total_steps_attempted + 1)^(-step_size_reduction_exponent)) *
step_size_limit where step_size_limit is the maximum allowed step size at
the current iteration.
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.Builder.clone() |
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.PrimalDualHybridGradientParams.Builder.getAdaptiveLinesearchParametersBuilder() |
optional .operations_research.pdlp.AdaptiveLinesearchParams adaptive_linesearch_parameters = 18;
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.Builder.mergeFrom(com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry) |
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.Builder.mergeFrom(com.google.protobuf.Message other) |
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.Builder.mergeFrom(Solvers.AdaptiveLinesearchParams other) |
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.Builder.mergeUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields) |
|
static Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.newBuilder() |
|
static Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.newBuilder(Solvers.AdaptiveLinesearchParams prototype) |
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.newBuilderForType() |
|
protected Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.newBuilderForType(com.google.protobuf.GeneratedMessageV3.BuilderParent parent) |
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.Builder.setField(com.google.protobuf.Descriptors.FieldDescriptor field,
java.lang.Object value) |
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.Builder.setRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field,
int index,
java.lang.Object value) |
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.Builder.setStepSizeGrowthExponent(double value) |
The step size growth exponent defines a step size given by (1 +
(total_steps_attempted + 1)^(-step_size_growth_exponent)) * step_size_.
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.Builder.setStepSizeReductionExponent(double value) |
The step size reduction exponent defines a step size given by
(1 - (total_steps_attempted + 1)^(-step_size_reduction_exponent)) *
step_size_limit where step_size_limit is the maximum allowed step size at
the current iteration.
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.Builder.setUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields) |
|
Solvers.AdaptiveLinesearchParams.Builder |
Solvers.AdaptiveLinesearchParams.toBuilder() |
|