Package com.google.ortools.pdlp

Interface Summary

Interface	Description
AdaptiveLinesearchParamsOrBuilder
ConvergenceInformationOrBuilder
FeasibilityPolishingDetailsOrBuilder
InfeasibilityInformationOrBuilder
IterationStatsOrBuilder
MalitskyPockParamsOrBuilder
PointMetadataOrBuilder
PrimalDualHybridGradientParams.PresolveOptionsOrBuilder
PrimalDualHybridGradientParamsOrBuilder
QuadraticProgramStatsOrBuilder
SolveLogOrBuilder
TerminationCriteria.DetailedOptimalityCriteriaOrBuilder
TerminationCriteria.SimpleOptimalityCriteriaOrBuilder
TerminationCriteriaOrBuilder

Class Summary

Class	Description
AdaptiveLinesearchParams	At the end of each iteration, regardless of whether the step was accepted or not, the adaptive rule updates the step_size as the minimum of two potential step sizes defined by the following two exponents.
AdaptiveLinesearchParams.Builder	At the end of each iteration, regardless of whether the step was accepted or not, the adaptive rule updates the step_size as the minimum of two potential step sizes defined by the following two exponents.
ConvergenceInformation	Information measuring how close a candidate is to establishing feasibility and optimality; see also TerminationCriteria.
ConvergenceInformation.Builder	Information measuring how close a candidate is to establishing feasibility and optimality; see also TerminationCriteria.
FeasibilityPolishingDetails	Details about one primal feasibility or dual feasibility polishing phase within a solve with `use_feasibility_polishing`.
FeasibilityPolishingDetails.Builder	Details about one primal feasibility or dual feasibility polishing phase within a solve with `use_feasibility_polishing`.
InfeasibilityInformation	Information measuring how close a point is to establishing primal or dual infeasibility (i.e.
InfeasibilityInformation.Builder	Information measuring how close a point is to establishing primal or dual infeasibility (i.e.
IterationStats	All values in IterationStats assume that the primal quadratic program is a minimization problem and the dual is a maximization problem.
IterationStats.Builder	All values in IterationStats assume that the primal quadratic program is a minimization problem and the dual is a maximization problem.
MalitskyPockParams	Protobuf type operations_research.pdlp.MalitskyPockParams
MalitskyPockParams.Builder	Protobuf type operations_research.pdlp.MalitskyPockParams
PointMetadata	Protobuf type operations_research.pdlp.PointMetadata
PointMetadata.Builder	Protobuf type operations_research.pdlp.PointMetadata
PrimalDualHybridGradientParams	Parameters for PrimalDualHybridGradient() in primal_dual_hybrid_gradient.h.
PrimalDualHybridGradientParams.Builder	Parameters for PrimalDualHybridGradient() in primal_dual_hybrid_gradient.h.
PrimalDualHybridGradientParams.PresolveOptions	Protobuf type operations_research.pdlp.PrimalDualHybridGradientParams.PresolveOptions
PrimalDualHybridGradientParams.PresolveOptions.Builder	Protobuf type operations_research.pdlp.PrimalDualHybridGradientParams.PresolveOptions
QuadraticProgramStats	Easy-to-compute statistics for the quadratic program.
QuadraticProgramStats.Builder	Easy-to-compute statistics for the quadratic program.
SolveLog	Protobuf type operations_research.pdlp.SolveLog
SolveLog.Builder	Protobuf type operations_research.pdlp.SolveLog
SolveLogOuterClass
Solvers
TerminationCriteria	Relevant readings on infeasibility certificates: (1) https://docs.mosek.com/modeling-cookbook/qcqo.html provides references explaining why the primal rays imply dual infeasibility and dual rays imply primal infeasibility.
TerminationCriteria.Builder	Relevant readings on infeasibility certificates: (1) https://docs.mosek.com/modeling-cookbook/qcqo.html provides references explaining why the primal rays imply dual infeasibility and dual rays imply primal infeasibility.
TerminationCriteria.DetailedOptimalityCriteria	Protobuf type operations_research.pdlp.TerminationCriteria.DetailedOptimalityCriteria
TerminationCriteria.DetailedOptimalityCriteria.Builder	Protobuf type operations_research.pdlp.TerminationCriteria.DetailedOptimalityCriteria
TerminationCriteria.SimpleOptimalityCriteria	Protobuf type operations_research.pdlp.TerminationCriteria.SimpleOptimalityCriteria
TerminationCriteria.SimpleOptimalityCriteria.Builder	Protobuf type operations_research.pdlp.TerminationCriteria.SimpleOptimalityCriteria

Enum Summary

Enum	Description
OptimalityNorm	Protobuf enum operations_research.pdlp.OptimalityNorm
PointType	Identifies the type of point used to compute the fields in a given proto; see ConvergenceInformation and InfeasibilityInformation.
PolishingPhaseType	Protobuf enum operations_research.pdlp.PolishingPhaseType
PrimalDualHybridGradientParams.LinesearchRule	Protobuf enum operations_research.pdlp.PrimalDualHybridGradientParams.LinesearchRule
PrimalDualHybridGradientParams.RestartStrategy	Protobuf enum operations_research.pdlp.PrimalDualHybridGradientParams.RestartStrategy
RestartChoice	Specifies whether a restart was performed on a given iteration.
TerminationCriteria.OptimalityCriteriaCase
TerminationReason	Protobuf enum operations_research.pdlp.TerminationReason