public interface TerminationCriteriaOrBuilder
extends com.google.protobuf.MessageOrBuilder
Modifier and Type | Method and Description |
---|---|
TerminationCriteria.DetailedOptimalityCriteria |
getDetailedOptimalityCriteria()
.operations_research.pdlp.TerminationCriteria.DetailedOptimalityCriteria detailed_optimality_criteria = 10; |
TerminationCriteria.DetailedOptimalityCriteriaOrBuilder |
getDetailedOptimalityCriteriaOrBuilder()
.operations_research.pdlp.TerminationCriteria.DetailedOptimalityCriteria detailed_optimality_criteria = 10; |
double |
getEpsDualInfeasible()
If the following three conditions hold we say we have obtained an
approximate primal ray, which is an approximate certificate of dual
infeasibility
|
double |
getEpsOptimalAbsolute()
Deprecated.
operations_research.pdlp.TerminationCriteria.eps_optimal_absolute is deprecated.
See ortools/pdlp/solvers.proto;l=147
|
double |
getEpsOptimalRelative()
Deprecated.
operations_research.pdlp.TerminationCriteria.eps_optimal_relative is deprecated.
See ortools/pdlp/solvers.proto;l=154
|
double |
getEpsPrimalInfeasible()
If the following two conditions hold we say that we have obtained an
approximate dual ray, which is an approximate certificate of primal
infeasibility
|
int |
getIterationLimit()
If termination_reason = TERMINATION_REASON_ITERATION_LIMIT then the solver
has taken at least iterations_limit iterations.
|
double |
getKktMatrixPassLimit()
If termination_reason = TERMINATION_REASON_KKT_MATRIX_PASS_LIMIT then
cumulative_kkt_matrix_passes is at least kkt_pass_limit.
|
TerminationCriteria.OptimalityCriteriaCase |
getOptimalityCriteriaCase() |
OptimalityNorm |
getOptimalityNorm()
The norm that we are measuring the optimality criteria in.
|
TerminationCriteria.SimpleOptimalityCriteria |
getSimpleOptimalityCriteria()
.operations_research.pdlp.TerminationCriteria.SimpleOptimalityCriteria simple_optimality_criteria = 9; |
TerminationCriteria.SimpleOptimalityCriteriaOrBuilder |
getSimpleOptimalityCriteriaOrBuilder()
.operations_research.pdlp.TerminationCriteria.SimpleOptimalityCriteria simple_optimality_criteria = 9; |
double |
getTimeSecLimit()
If termination_reason = TERMINATION_REASON_TIME_LIMIT then the solver has
taken at least time_sec_limit time.
|
boolean |
hasDetailedOptimalityCriteria()
.operations_research.pdlp.TerminationCriteria.DetailedOptimalityCriteria detailed_optimality_criteria = 10; |
boolean |
hasEpsDualInfeasible()
If the following three conditions hold we say we have obtained an
approximate primal ray, which is an approximate certificate of dual
infeasibility
|
boolean |
hasEpsOptimalAbsolute()
Deprecated.
operations_research.pdlp.TerminationCriteria.eps_optimal_absolute is deprecated.
See ortools/pdlp/solvers.proto;l=147
|
boolean |
hasEpsOptimalRelative()
Deprecated.
operations_research.pdlp.TerminationCriteria.eps_optimal_relative is deprecated.
See ortools/pdlp/solvers.proto;l=154
|
boolean |
hasEpsPrimalInfeasible()
If the following two conditions hold we say that we have obtained an
approximate dual ray, which is an approximate certificate of primal
infeasibility
|
boolean |
hasIterationLimit()
If termination_reason = TERMINATION_REASON_ITERATION_LIMIT then the solver
has taken at least iterations_limit iterations.
|
boolean |
hasKktMatrixPassLimit()
If termination_reason = TERMINATION_REASON_KKT_MATRIX_PASS_LIMIT then
cumulative_kkt_matrix_passes is at least kkt_pass_limit.
|
boolean |
hasOptimalityNorm()
The norm that we are measuring the optimality criteria in.
|
boolean |
hasSimpleOptimalityCriteria()
.operations_research.pdlp.TerminationCriteria.SimpleOptimalityCriteria simple_optimality_criteria = 9; |
boolean |
hasTimeSecLimit()
If termination_reason = TERMINATION_REASON_TIME_LIMIT then the solver has
taken at least time_sec_limit time.
|
findInitializationErrors, getAllFields, getDefaultInstanceForType, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof
boolean hasOptimalityNorm()
The norm that we are measuring the optimality criteria in.
optional .operations_research.pdlp.OptimalityNorm optimality_norm = 1 [default = OPTIMALITY_NORM_L2];
OptimalityNorm getOptimalityNorm()
The norm that we are measuring the optimality criteria in.
optional .operations_research.pdlp.OptimalityNorm optimality_norm = 1 [default = OPTIMALITY_NORM_L2];
boolean hasSimpleOptimalityCriteria()
.operations_research.pdlp.TerminationCriteria.SimpleOptimalityCriteria simple_optimality_criteria = 9;
TerminationCriteria.SimpleOptimalityCriteria getSimpleOptimalityCriteria()
.operations_research.pdlp.TerminationCriteria.SimpleOptimalityCriteria simple_optimality_criteria = 9;
TerminationCriteria.SimpleOptimalityCriteriaOrBuilder getSimpleOptimalityCriteriaOrBuilder()
.operations_research.pdlp.TerminationCriteria.SimpleOptimalityCriteria simple_optimality_criteria = 9;
boolean hasDetailedOptimalityCriteria()
.operations_research.pdlp.TerminationCriteria.DetailedOptimalityCriteria detailed_optimality_criteria = 10;
TerminationCriteria.DetailedOptimalityCriteria getDetailedOptimalityCriteria()
.operations_research.pdlp.TerminationCriteria.DetailedOptimalityCriteria detailed_optimality_criteria = 10;
TerminationCriteria.DetailedOptimalityCriteriaOrBuilder getDetailedOptimalityCriteriaOrBuilder()
.operations_research.pdlp.TerminationCriteria.DetailedOptimalityCriteria detailed_optimality_criteria = 10;
@Deprecated boolean hasEpsOptimalAbsolute()
Absolute tolerance on primal residual, dual residual, and the objective gap. Deprecated, use simple_optimality_criteria instead. TODO(b/241462829) delete this deprecated field.
optional double eps_optimal_absolute = 2 [default = 1e-06, deprecated = true];
@Deprecated double getEpsOptimalAbsolute()
Absolute tolerance on primal residual, dual residual, and the objective gap. Deprecated, use simple_optimality_criteria instead. TODO(b/241462829) delete this deprecated field.
optional double eps_optimal_absolute = 2 [default = 1e-06, deprecated = true];
@Deprecated boolean hasEpsOptimalRelative()
Relative tolerance on primal residual, dual residual, and the objective gap. Deprecated, use simple_optimality_criteria instead. TODO(b/241462829) delete this deprecated field.
optional double eps_optimal_relative = 3 [default = 1e-06, deprecated = true];
@Deprecated double getEpsOptimalRelative()
Relative tolerance on primal residual, dual residual, and the objective gap. Deprecated, use simple_optimality_criteria instead. TODO(b/241462829) delete this deprecated field.
optional double eps_optimal_relative = 3 [default = 1e-06, deprecated = true];
boolean hasEpsPrimalInfeasible()
If the following two conditions hold we say that we have obtained an approximate dual ray, which is an approximate certificate of primal infeasibility. (1) dual_ray_objective > 0, (2) max_dual_ray_infeasibility / dual_ray_objective <= eps_primal_infeasible.
optional double eps_primal_infeasible = 4 [default = 1e-08];
double getEpsPrimalInfeasible()
If the following two conditions hold we say that we have obtained an approximate dual ray, which is an approximate certificate of primal infeasibility. (1) dual_ray_objective > 0, (2) max_dual_ray_infeasibility / dual_ray_objective <= eps_primal_infeasible.
optional double eps_primal_infeasible = 4 [default = 1e-08];
boolean hasEpsDualInfeasible()
If the following three conditions hold we say we have obtained an approximate primal ray, which is an approximate certificate of dual infeasibility. (1) primal_ray_linear_objective < 0, (2) max_primal_ray_infeasibility / (-primal_ray_linear_objective) <= eps_dual_infeasible (3) primal_ray_quadratic_norm / (-primal_ray_linear_objective) <= eps_dual_infeasible.
optional double eps_dual_infeasible = 5 [default = 1e-08];
double getEpsDualInfeasible()
If the following three conditions hold we say we have obtained an approximate primal ray, which is an approximate certificate of dual infeasibility. (1) primal_ray_linear_objective < 0, (2) max_primal_ray_infeasibility / (-primal_ray_linear_objective) <= eps_dual_infeasible (3) primal_ray_quadratic_norm / (-primal_ray_linear_objective) <= eps_dual_infeasible.
optional double eps_dual_infeasible = 5 [default = 1e-08];
boolean hasTimeSecLimit()
If termination_reason = TERMINATION_REASON_TIME_LIMIT then the solver has taken at least time_sec_limit time.
optional double time_sec_limit = 6 [default = inf];
double getTimeSecLimit()
If termination_reason = TERMINATION_REASON_TIME_LIMIT then the solver has taken at least time_sec_limit time.
optional double time_sec_limit = 6 [default = inf];
boolean hasIterationLimit()
If termination_reason = TERMINATION_REASON_ITERATION_LIMIT then the solver has taken at least iterations_limit iterations.
optional int32 iteration_limit = 7 [default = 2147483647];
int getIterationLimit()
If termination_reason = TERMINATION_REASON_ITERATION_LIMIT then the solver has taken at least iterations_limit iterations.
optional int32 iteration_limit = 7 [default = 2147483647];
boolean hasKktMatrixPassLimit()
If termination_reason = TERMINATION_REASON_KKT_MATRIX_PASS_LIMIT then cumulative_kkt_matrix_passes is at least kkt_pass_limit.
optional double kkt_matrix_pass_limit = 8 [default = inf];
double getKktMatrixPassLimit()
If termination_reason = TERMINATION_REASON_KKT_MATRIX_PASS_LIMIT then cumulative_kkt_matrix_passes is at least kkt_pass_limit.
optional double kkt_matrix_pass_limit = 8 [default = inf];
TerminationCriteria.OptimalityCriteriaCase getOptimalityCriteriaCase()
Copyright © 2025. All rights reserved.