Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include "ortools/pdlp/iteration_stats.h"
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <limits>
#include <optional>
#include <random>
#include <utility>
#include <vector>
#include "Eigen/Core"
#include "Eigen/SparseCore"
#include "absl/log/check.h"
#include "absl/random/distributions.h"
#include "ortools/base/mathutil.h"
#include "ortools/pdlp/quadratic_program.h"
#include "ortools/pdlp/sharded_quadratic_program.h"
#include "ortools/pdlp/sharder.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::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) |
ConvergenceInformation | operations_research::pdlp::ComputeScaledConvergenceInformation (const PrimalDualHybridGradientParams ¶ms, const ShardedQuadraticProgram &sharded_qp, const VectorXd &primal_solution, const VectorXd &dual_solution, const double componentwise_primal_residual_offset, const double componentwise_dual_residual_offset, PointType candidate_type) |
VectorXd | operations_research::pdlp::ReducedCosts (const PrimalDualHybridGradientParams ¶ms, const ShardedQuadraticProgram &sharded_qp, const VectorXd &primal_solution, const VectorXd &dual_solution, bool use_zero_primal_objective) |
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) |
double l_2_residual |
Definition at line 53 of file iteration_stats.cc.
double l_inf_componentwise_residual |
Definition at line 54 of file iteration_stats.cc.
double l_inf_residual |
Definition at line 52 of file iteration_stats.cc.
double lower_bound |
Definition at line 147 of file iteration_stats.cc.
double objective_correction |
Definition at line 50 of file iteration_stats.cc.
double objective_full_correction |
Definition at line 51 of file iteration_stats.cc.
double upper_bound |
Definition at line 148 of file iteration_stats.cc.