Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <optional>
#include <vector>
#include "Eigen/Core"
#include "ortools/pdlp/sharded_quadratic_program.h"
#include "ortools/pdlp/solve_log.pb.h"
#include "ortools/pdlp/solvers.pb.h"
Go to the source code of this file.
Namespaces | |
namespace | operations_research |
In SWIG mode, we don't want anything besides these top-level includes. | |
namespace | operations_research::pdlp |
Validation utilities for solvers.proto. | |
Functions | |
ConvergenceInformation | operations_research::pdlp::ComputeScaledConvergenceInformation (const PrimalDualHybridGradientParams ¶ms, const ShardedQuadraticProgram &sharded_qp, const Eigen::VectorXd &primal_solution, const Eigen::VectorXd &dual_solution, double componentwise_primal_residual_offset, double componentwise_dual_residual_offset, PointType candidate_type) |
ConvergenceInformation | operations_research::pdlp::ComputeConvergenceInformation (const PrimalDualHybridGradientParams ¶ms, const ShardedQuadraticProgram &scaled_sharded_qp, const Eigen::VectorXd &col_scaling_vec, const Eigen::VectorXd &row_scaling_vec, const Eigen::VectorXd &scaled_primal_solution, const Eigen::VectorXd &scaled_dual_solution, const double componentwise_primal_residual_offset, const double componentwise_dual_residual_offset, PointType candidate_type) |
InfeasibilityInformation | operations_research::pdlp::ComputeInfeasibilityInformation (const PrimalDualHybridGradientParams ¶ms, const ShardedQuadraticProgram &scaled_sharded_qp, const Eigen::VectorXd &col_scaling_vec, const Eigen::VectorXd &row_scaling_vec, const Eigen::VectorXd &scaled_primal_ray, const Eigen::VectorXd &scaled_dual_ray, const Eigen::VectorXd &primal_solution_for_residual_tests, PointType candidate_type) |
Eigen::VectorXd | operations_research::pdlp::ReducedCosts (const PrimalDualHybridGradientParams ¶ms, const ShardedQuadraticProgram &scaled_sharded_qp, const Eigen::VectorXd &primal_solution, const Eigen::VectorXd &dual_solution, bool use_zero_primal_objective=false) |
std::optional< ConvergenceInformation > | operations_research::pdlp::GetConvergenceInformation (const IterationStats &stats, PointType candidate_type) |
std::optional< InfeasibilityInformation > | operations_research::pdlp::GetInfeasibilityInformation (const IterationStats &stats, PointType candidate_type) |
std::optional< PointMetadata > | operations_research::pdlp::GetPointMetadata (const IterationStats &stats, const PointType point_type) |
void | operations_research::pdlp::SetRandomProjections (const ShardedQuadraticProgram &sharded_qp, const Eigen::VectorXd &primal_solution, const Eigen::VectorXd &dual_solution, const std::vector< int > &random_projection_seeds, PointMetadata &metadata) |