#include "BonminConfig.h"
#include "BonBqpdSolver.hpp"
#include "BonBqpdWarmStart.hpp"
#include "CoinTime.hpp"
#include <algorithm>
Include dependency graph for BonBqpdSolver.cpp:
Go to the source code of this file.
#define InitializeAll |
Definition at line 19 of file BonBqpdSolver.cpp.
typedef Bonmin::BqpdSolver::fint fint |
Definition at line 21 of file BonBqpdSolver.cpp.
typedef Bonmin::BqpdSolver::real real |
Definition at line 22 of file BonBqpdSolver.cpp.
void F77_FUNC | ( | bqpd | , | |
BQPD | ||||
) |
Definition at line 27 of file BonBqpdSolver.cpp.
Referenced by CutGen::additionalSDPcuts(), Bonmin::addOuterDescription(), BCP_problem_core::BCP_problem_core(), MC_lp::choose_branching_vars(), QuadraticCuts::computeEigenvectorsFromCurrentSolution(), cpp_genalea(), MC_tm::create_root(), disjunctiveCutGen(), MC_solution::edge_switch_improve(), Bonmin::HeuristicInnerApproximation::extractInnerApproximation(), Bonmin::OuterApprox::extractLinearRelaxation(), CutGen::generateCuts(), Couenne::CouenneTwoImplied::generateCuts(), Couenne::CouenneFixPoint::generateCuts(), Couenne::CouenneDisjCuts::generateDisjCuts(), OSInstance::getADSparsityHessian(), getConstraintMatrix(), OSInstance::getDenseObjectiveCoefficients(), Bonmin::HeuristicInnerApproximation::getMyInnerApproximation(), Bonmin::getMyOuterApproximation(), Bonmin::TMINLP::hasGeneralInteger(), MC_tm::initialize_core(), OSInstance::initObjGradients(), MC_solution::ising_with_external_edge_switch_improve(), BCP_lp_user::load_problem(), MC_lp::logical_fixing(), main(), MC_cuts_from_mst(), MC_lp::mc_generate_heuristic_solution(), MC_generate_shortest_path_cycles(), MC_kruskal(), MC_mst_cutgen(), MC_mst_heur(), MC_readproblem(), MC_solution::MC_solution(), Couenne::CouenneDisjCuts::OsiCuts2MatrVec(), Couenne::exprQuad::print(), Bonmin::AmplTMINLP::read_priorities(), Bonmin::AmplTMINLP::read_sos(), Bonmin::BqpdSolver::ReOptimizeTNLP(), CoinSolver::setSolverOptions(), Bonmin::MilpRounding::solution(), Bonmin::TMINLP2TNLPQuadCuts::TMINLP2TNLPQuadCuts(), MC_problem::unpack(), CutGen::update_sparsify_structures(), and Bonmin::TNLPSolver::zeroDimension().
Definition at line 27 of file BonBqpdSolver.cpp.
Referenced by addDistanceConstraints(), CutGen::additionalSDPcuts(), OSInstance::addQTermsToExressionTree(), Couenne::exprQuad::alphaConvexify(), Balloc(), BCP_tm_balance_data(), BCP_vec_change< char >::BCP_vec_change(), CoinSolver::buildSolverInstance(), OSnLNodeAllDiff::calculateFunction(), check_prod_row_barQ(), QuadraticCuts::checkPreviousQuadraticEVCutsOnCurrentSolution(), Couenne::exprPow::closestFeasible(), CutGen::compareSparsify(), ComputeSquareRoot(), cpp_genalea(), Bonmin::TMat::create(), OSColGenApp::createChild(), OSgams2osil::createOSInstance(), Couenne::CouenneFixPoint::createRow(), dataset::dataset(), disjunctiveCutGen(), SparseMatrix::display(), distance(), MC_solution::edge_switch_improve(), BCP_parameter_set< BCP_tm_par >::expand(), Couenne::ExprJac::ExprJac(), Bonmin::OuterApprox::extractLinearRelaxation(), feasibility_check(), Couenne::CouenneIterativeRounding::feasibilityIR(), find_tree_manager(), dataset::fprint(), BB_lp::generate_heuristic_solution(), CutGen::generateCuts(), Couenne::exprPow::generateCuts(), Couenne::exprDiv::generateCuts(), Couenne::CouenneTwoImplied::generateCuts(), OS_DipInterface::generateInitialMaster(), Couenne::exprPow::getBounds(), OSBearcatSolverXkij::getColumns(), OSBearcatSolverXij::getColumns(), OSBearcatSolverXij::getCutsMultiCommod(), OSBearcatSolverXkij::getCutsTheta(), OSBearcatSolverXij::getCutsTheta(), OSBearcatSolverXkij::getCutsX(), OSBearcatSolverXij::getCutsX(), OSInstance::getFirstOrderResults(), OSOption::getInitConValuesDense(), OSOption::getInitDualVarLowerBoundsDense(), OSOption::getInitDualVarUpperBoundsDense(), OSBearcatSolverXkij::getInitialRestrictedMaster(), OSBearcatSolverXij::getInitialRestrictedMaster(), OSOption::getInitObjLowerBoundsDense(), OSOption::getInitObjUpperBoundsDense(), OSOption::getInitObjValuesDense(), OSOption::getInitVarValuesDense(), OSOption::getInitVarValuesStringDense(), OSOption::getIntegerVariableBranchingWeightsDense(), MC_lp::getMaxLpViol(), getMult(), getMultIncr(), OSOption::getObjectiveInitialBasisStatusDense(), OSBearcatSolverXij::getOptions(), OSBearcatSolverXkij::getOptL(), OSBearcatSolverXij::getOptL(), OS_DipInterface::getRow(), OSInstance::getSecondOrderResults(), OSOption::getSlackVariableInitialBasisStatusDense(), OSInstance::getSparseJacobianFromRowMajor(), OSOption::getVariableInitialBasisStatusDense(), HessElemFill(), Heuristics::Heuristics(), Heuristics::heurLP_improveSolution(), hi0bits(), Couenne::CouenneIterativeRounding::improvementIR(), OSBearcatSolverXkij::initializeDataStructures(), OSBearcatSolverXij::initializeDataStructures(), interactiveShell(), Bonmin::QuadRow::internal_eval_grad(), Bonmin::isDifferentOnIntegers(), MC_solution::ising_with_external_edge_switch_improve(), lo0bits(), KnitroProblem::loadProblemIntoKnitro(), MC_lp::logical_fixing(), main(), MC_components(), MC_cuts_from_mst(), MC_kruskal(), MC_readproblem(), MC_solution::MC_solution(), MCF1_adjust_bounds(), MCF2_adjust_bounds(), MCF3_adjust_bounds(), Heuristics::MNHeur(), mult(), CutGen::myremoveBestOneRowCol(), orthoCutGen(), os_dtoa_format(), Couenne::CouenneDisjCuts::OsiCuts2MatrVec(), Couenne::CouenneDisjCuts::OsiSI2MatrVec(), powNewton(), Couenne::powNewton(), OS_lp::process_lp_result(), Couenne::CouenneAmplInterface::readnl(), Bonmin::TMINLP2TNLPQuadCuts::removeCuts(), s2b(), Couenne::exprPow::selectBranch(), OSInstance::setLinearConstraintCoefficients(), OSInstance::setQuadraticTerms(), CoinSolver::setSolverOptions(), Bonmin::CbcStrategyChooseCuts::setup(), Bonmin::CbcStrategyChooseCuts::setupCutGenerators(), Couenne::exprOp::shrink_arglist(), Bonmin::MilpRounding::solution(), Bonmin::HeuristicFPump::solution(), OSColGenApp::solveRestrictedMasterRelaxation(), ampl_utils::sos_kludge(), MC_solution::structure_switch_improve(), MC_lp::test_feasibility(), BB_lp::test_feasibility(), testOa(), Couenne::trigNewton(), MC_lp::unique_cycle_cuts(), Bonmin::QuadCut::violated(), OSiLWriter::writeOSiL(), and OSResult::~OSResult().
Definition at line 27 of file BonBqpdSolver.cpp.
Referenced by b2d(), OSnLNodeErf::calculateFunction(), cmp(), OSnLNodeErf::constructADTape(), cpp_genalea(), diff(), doubleEqual(), Report::doubleEqual(), Bonmin::OuterApprox::extractLinearRelaxation(), Couenne::findIntersection(), Bonmin::HeuristicInnerApproximation::getMyInnerApproximation(), mult(), Couenne::CouenneAmplInterface::nl2e(), Couenne::projectSeg(), Couenne::exprQuad::quadCuts(), ratio(), and ulp().
Definition at line 27 of file BonBqpdSolver.cpp.
Referenced by Couenne::CouenneProblem::aggressiveBT(), BCP_vec< BCP_lp_result * >::append(), BCP_var_set::append(), BCP_cut_set::append(), Balloc(), BCP_cut_core::BCP_cut_core(), BCP_lp_fix_vars(), BCP_lp_select_branching_object(), BCP_var_core::BCP_var_core(), BCP_vec< T >::BCP_vec(), Couenne::exprPow::closestFeasible(), Couenne::exprDiv::closestFeasible(), MCF3_lp::compute_lower_bound(), MCF2_lp::compute_lower_bound(), MCF1_lp::compute_lower_bound(), MC_tm::create_root(), Couenne::CouenneCutGenerator::createCut(), d2b(), OS_lp::display_lp_solution(), BCP_lp_user::display_lp_solution(), draw_cuts(), Couenne::CouenneFPpool::findClosestAndReplace(), MC_lp::generate_cuts_in_lp(), BB_lp::generate_heuristic_solution(), Couenne::exprAux::generateCuts(), Couenne::exprSub::generateCuts(), Couenne::exprPow::generateCuts(), Couenne::exprLog::generateCuts(), Couenne::exprExp::generateCuts(), Couenne::exprDiv::generateCuts(), Couenne::CouenneCutGenerator::generateCuts(), Couenne::CouenneOSInterface::getCouenneProblem(), Couenne::CouenneProblem::getIntegerCandidate(), hexnan(), hi0bits(), Couenne::CouenneSolverInterface< T >::initialSolve(), Couenne::exprPow::isCuttable(), Couenne::exprLog::isCuttable(), Couenne::exprInv::isCuttable(), Couenne::exprExp::isCuttable(), Couenne::exprAbs::isCuttable(), lo0bits(), lshift(), main(), Heuristics::MNHeur(), mult(), multadd(), Couenne::exprQuad::operator()(), Couenne::exprVar::operator()(), Couenne::exprAux::operator()(), BCP_vec< int >::operator=(), BCP_vec< double >::operator=(), BCP_vec< char >::operator=(), BCP_vec< T >::operator=(), BCP_parameter_set< BCP_tm_par >::operator=(), BCP_row::operator=(), BCP_col::operator=(), operator==(), LindoSolver::optimize(), os_dtoa(), Couenne::CouenneDisjCuts::OsiSI2MatrVec(), BCP_lp_user::pack_primal_solution(), OS_lp::process_lp_result(), Couenne::CouenneAmplInterface::readnl(), readProblem(), Couenne::CouenneProblem::redCostBT(), Couenne::CouenneProblem::reformulate(), Couenne::exprQuad::replace(), Couenne::exprGroup::replace(), Couenne::exprUnary::replace(), Couenne::exprOp::replace(), Couenne::CouenneSolverInterface< T >::resolve(), s2b(), OS_lp::select_branching_candidates(), BB_lp::select_branching_candidates(), Bonmin::BqpdSolver::setWarmStart(), Couenne::CouenneFeasPump::solution(), Couenne::CouenneSolverInterface< T >::solveFromHotStart(), BCP_obj_set_change::swap(), BCP_vec< T >::swap(), BCP_lp_user::test_binary(), MCF3_lp::test_feasibility(), MCF2_lp::test_feasibility(), MCF1_lp::test_feasibility(), MC_lp::test_feasibility(), BB_lp::test_feasibility(), BCP_lp_user::test_full(), BCP_lp_user::test_integral(), testFp(), ulp(), CouenneSolver::writeResult(), CoinSolver::writeResult(), and Heuristics::xxTHeur().
Definition at line 27 of file BonBqpdSolver.cpp.
Referenced by BCP_tm_create_root(), BCP_tm_save_root_cuts(), MCF3_tm::display_feasible_solution(), MCF2_tm::display_feasible_solution(), MCF1_tm::display_feasible_solution(), main(), MCF1_adjust_bounds(), MCF2_adjust_bounds(), MCF3_adjust_bounds(), powNewton(), Couenne::powNewton(), Couenne::CouenneProblem::readOptimum(), Bonmin::OsiTMINLPInterface::resolveForCost(), Bonmin::OsiTMINLPInterface::resolveForRobustness(), MCF3_lp::test_feasibility(), MCF2_lp::test_feasibility(), MCF1_lp::test_feasibility(), Couenne::trigEnvelope(), Couenne::CouenneProblem::writeAMPL(), and Couenne::CouenneProblem::writeGAMS().
Definition at line 27 of file BonBqpdSolver.cpp.
Referenced by Bonmin::BqpdSolver::cachedInfo::optimize().
Definition at line 27 of file BonBqpdSolver.cpp.
Referenced by Couenne::DepNode::createOrder(), Bonmin::HeuristicInnerApproximation::extractInnerApproximation(), Bonmin::OsiTMINLPInterface::extractLinearRelaxation(), Bonmin::OuterApprox::extractLinearRelaxation(), Couenne::exprQuad::fillDepSet(), Couenne::exprGroup::fillDepSet(), Couenne::exprVar::fillDepSet(), Couenne::exprUnary::fillDepSet(), Couenne::exprOp::fillDepSet(), Couenne::exprCopy::fillDepSet(), Bonmin::OsiTMINLPInterface::getBendersCut(), Bonmin::HeuristicInnerApproximation::getMyInnerApproximation(), and Bonmin::OsiTMINLPInterface::getOuterApproximation().
Definition at line 27 of file BonBqpdSolver.cpp.
Referenced by cpp_quicksort_dec(), cpp_quicksort_inc(), cpp_quicksortINT_dec(), cpp_quicksortINT_inc(), OSDipApp::createModelPart(), OSInstance::getADSparsityHessian(), main(), Couenne::exprQuad::rank(), Couenne::exprGroup::rank(), Couenne::exprOp::rank(), and rv_alloc().
Definition at line 27 of file BonBqpdSolver.cpp.
Referenced by Couenne::CouenneProblem::addAuxiliary(), CutGen::additionalSDPcuts(), b2d(), MC_lp::choose_branching_vars(), QuadraticCuts::computeEigenvectorsFromCurrentSolution(), MCF3_tm::create_root(), MCF2_tm::create_root(), MCF1_tm::create_root(), disjunctiveCutGen(), MC_lp::generate_mst_cuts(), Couenne::exprVar::generateCuts(), Couenne::exprConst::generateCuts(), Couenne::exprCopy::generateCuts(), CutGen::generateCuts(), Couenne::exprTrilinear::generateCuts(), Couenne::exprSum::generateCuts(), Couenne::exprSub::generateCuts(), Couenne::exprCos::generateCuts(), Couenne::exprSin::generateCuts(), Couenne::exprQuad::generateCuts(), Couenne::exprPow::generateCuts(), Couenne::exprOpp::generateCuts(), Couenne::exprGroup::generateCuts(), Couenne::exprDiv::generateCuts(), Couenne::exprAbs::generateCuts(), main(), MC_lp::mc_generate_heuristic_solution(), CutGen::myremoveBestOneRowCol(), Couenne::exprQuad::quadCuts(), Couenne::exprQuad::replace(), Couenne::exprGroup::replace(), Couenne::exprUnary::replace(), Couenne::exprOp::replace(), Couenne::CouenneConstraint::standardize(), and Couenne::trigEnvelope().
Definition at line 27 of file BonBqpdSolver.cpp.
Referenced by Bonmin::QuadRow::add_to_hessian(), Stat::addEntry(), Bonmin::BonminSetup::addMilpCutGenerators(), Bonmin::OsiTMINLPInterface::addObjectiveFunction(), BCP_warmstart_dual::as_change(), BCP_lp_add_from_local_var_pool(), BCP_tm_create_core(), check_prod_row_barQ(), CheckHessianUpper(), Couenne::CouenneProblem::checkNLP(), QuadraticCuts::checkPreviousQuadraticEVCutsOnCurrentSolution(), Couenne::CouenneChooseStrong::chooseVariable(), Couenne::combine(), Couenne::exprQuad::compare(), Couenne::exprGroup::compare(), Couenne::exprCopy::compare(), BCP_lp_user::compare_branching_candidates(), BCP_lp_user::compute_lower_bound(), MCF3_lp::compute_lower_bound(), MCF2_lp::compute_lower_bound(), MCF1_lp::compute_lower_bound(), Couenne::CouenneVarObject::computeBranchingPoint(), Bonmin::CutStrengthener::ComputeCuts(), Bonmin::CurvatureEstimator::ComputeNullSpaceCurvature(), Couenne::CouenneTNLP::CouenneTNLP(), Couenne::CouExpr::CouExpr(), createCommonExpr(), createCut(), Couenne::CouenneCutGenerator::createCut(), disjunctiveCutGen(), Couenne::exprConst::exprConst(), Couenne::exprCopy::exprCopy(), Couenne::ExprHess::ExprHess(), Couenne::ExprJac::ExprJac(), Bonmin::OsiTMINLPInterface::extractLinearRelaxation(), Bonmin::OuterApprox::extractLinearRelaxation(), Couenne::CouenneObject::feasibleRegion(), Bonmin::SubMipSolver::find_good_sol(), Couenne::exprGroup::generateCuts(), Couenne::CouenneTwoImplied::generateCuts(), Bonmin::LinearCutsGenerator::generateCuts(), Bonmin::OaNlpOptim::generateCuts(), CutGen::genSDPcut(), OSInstance::getADSparsityHessian(), Bonmin::OsiTMINLPInterface::getBendersCut(), Couenne::exprLog::getBounds(), Bonmin::OsiTMINLPInterface::getDblParam(), Bonmin::HeuristicInnerApproximation::getMyInnerApproximation(), Bonmin::getMyOuterApproximation(), Couenne::getOriginal(), Bonmin::OsiTMINLPInterface::getOuterApproximation(), Couenne::CouenneChooseStrong::gutsOfSetupList(), Bonmin::CutStrengthener::HandleOneCut(), Bonmin::OsiTMINLPInterface::isFreeBinary(), main(), Couenne::CouenneObject::midInterval(), BMSearchTreeCompareBest::operator()(), Couenne::CouExpr::operator=(), Bonmin::OACutGenerator2::performOa(), Bonmin::MinlpFeasPump::performOa(), BCP_tm_stat::print(), BCP_tm_prob::process_message(), Couenne::exprQuad::quadCuts(), Couenne::CouenneAmplInterface::readnl(), reAlloc(), Bonmin::register_OA_options(), Bonmin::BabSetupBase::registerAllOptions(), Bonmin::EcpCuts::registerOptions(), Bonmin::LpBranchingSolver::registerOptions(), Couenne::CouenneSolverInterface< T >::resolve(), Bonmin::OsiTMINLPInterface::resolve(), Couenne::rootQ(), MCF3_lp::select_branching_candidates(), MCF2_lp::select_branching_candidates(), MCF1_lp::select_branching_candidates(), Bonmin::HeuristicDiveVectorLength::selectVariableToBranch(), Bonmin::HeuristicDiveMIPVectorLength::selectVariableToBranch(), BCP_parameter_set< BCP_tm_par >::set_default_entries(), BCP_parameter_set< BCP_lp_par >::set_default_entries(), Couenne::CouenneObject::setEstimates(), Bonmin::IpoptSolver::setMinlpDefaults(), Couenne::CouenneFeasPump::solution(), Couenne::NlpSolveHeuristic::solution(), Bonmin::HeuristicInnerApproximation::solution(), KnitroSolver::solve(), CoinSolver::solve(), Bonmin::LpBranchingSolver::solveFromHotStart(), Couenne::CouenneFeasPump::solveMILP(), ampl_utils::sos_kludge(), MC_solution::structure_switch_improve(), MCF3_lp::test_feasibility(), MCF2_lp::test_feasibility(), MCF1_lp::test_feasibility(), BCP_var::test_inactive(), testFp(), testOa(), testOptimAndSolutionQuery(), testSetMethods(), Couenne::CouenneSolverInterface< T >::tightenBoundsCLP(), BM_lp::unpack_module_data(), Bonmin::HotInfo::updateInformation(), Bonmin::BonChooseVariable::updateInformation(), writeOtherOptionEnumeration(), Bonmin::TNLPSolver::zeroDimension(), Couenne::CouenneChooseStrong::~CouenneChooseStrong(), Couenne::CouenneDisjCuts::~CouenneDisjCuts(), and Couenne::CouenneTwoImplied::~CouenneTwoImplied().
Definition at line 27 of file BonBqpdSolver.cpp.
Definition at line 27 of file BonBqpdSolver.cpp.
Referenced by BCP_add_branching_objects(), BCP_lp_delete_cols_and_rows(), BCP_lp_perform_strong_branching(), BCP_lp_prepare_for_new_node(), BCP_tm_assign_processes(), BCP_tm_change_config(), BCP_tm_wrapup(), createCloneMILP(), MC_initialize::lp_init(), Bonmin::OaFeasibilityChecker::performOa(), Bonmin::OACutGenerator2::performOa(), Bonmin::MinlpFeasPump::performOa(), Couenne::CouenneAggrProbing::probeVariable(), Couenne::CouenneAggrProbing::probeVariable2(), BCP_lp_user::select_branching_candidates(), MC_lp::select_branching_candidates(), testOa(), and BM_pack::unpack_user_data().
Definition at line 27 of file BonBqpdSolver.cpp.
void fint fint fint real fint real real real real real real real real real fint real fint fint fint* peq |
Definition at line 27 of file BonBqpdSolver.cpp.
void fint fint fint real fint real real real real real real real real real fint real fint fint fint real* ws |
Definition at line 27 of file BonBqpdSolver.cpp.
Referenced by BCP_warmstart_primaldual::as_change(), BCP_warmstart_dual::as_change(), BCP_warmstart_basis::as_change(), BCP_lp_convert_CoinWarmStart(), BCP_lp_create_lp(), BCP_lp_delete_cols_and_rows(), BCP_lp_perform_strong_branching(), BCP_lp_send_node_description(), BCP_pack_warmstart(), BCP_tm_rebroadcast_root_warmstart(), BM_lp::do_distributed_SB(), Bonmin::IpoptWarmStart::generateDiff(), BCP_user_pack::pack_warmstart(), BB_packer::pack_warmstart(), BM_lp::process_message(), BCP_lp_prob::process_message(), Couenne::CouenneSolverInterface< T >::resolve(), Bonmin::IpoptSolver::setWarmStart(), and testSetMethods().
void fint fint fint real fint real real real real real real real real real fint real fint fint fint real fint* lws |
Definition at line 27 of file BonBqpdSolver.cpp.
void fint fint fint real fint real real real real real real real real real fint real fint fint fint real fint fint* m0de |
Definition at line 27 of file BonBqpdSolver.cpp.
void fint fint fint real fint real real real real real real real real real fint real fint fint fint real fint fint fint* ifail |
Definition at line 27 of file BonBqpdSolver.cpp.
Referenced by _dsyevx_index_range_wrapper(), _dsyevx_value_range_wrapper(), and Bonmin::BqpdSolver::callOptimizer().
void fint fint fint real fint real real real real real real real real real fint real fint fint fint real fint fint fint fint* info |
Definition at line 27 of file BonBqpdSolver.cpp.
Referenced by _dsyevx_index_range_wrapper(), _dsyevx_value_range_wrapper(), Couenne::exprQuad::alphaConvexify(), BM_lp::generate_cuts_in_lp(), main(), Couenne::NlpSolveHeuristic::solution(), Bonmin::PumpForMinlp::solution(), Bonmin::FixAndSolveHeuristic::solution(), and Bonmin::DummyPump::solution().
void fint fint fint real fint real real real real real real real real real fint real fint fint fint real fint fint fint fint fint* iprint |
Definition at line 27 of file BonBqpdSolver.cpp.
void fint fint fint real fint real real real real real real real real real fint real fint fint fint real fint fint fint fint fint fint* nout |
Definition at line 27 of file BonBqpdSolver.cpp.
Definition at line 36 of file BonBqpdSolver.cpp.
Referenced by Couenne::CouenneTwoImplied::generateCuts(), and OSiLWriter::writeOSiL().
Definition at line 36 of file BonBqpdSolver.cpp.
Referenced by Couenne::CouenneCutGenerator::createCut(), Couenne::CouenneInterface::extractLinearRelaxation(), Couenne::CouenneCutGenerator::generateCuts(), and Couenne::CouenneProblem::tightenBounds().
Definition at line 36 of file BonBqpdSolver.cpp.
Referenced by Bonmin::BqpdSolver::cachedInfo::optimize().
Definition at line 36 of file BonBqpdSolver.cpp.
Referenced by Bonmin::BqpdSolver::cachedInfo::optimize().
Definition at line 36 of file BonBqpdSolver.cpp.
Definition at line 36 of file BonBqpdSolver.cpp.
struct { ... } wsc |
struct { ... } WSC |
Definition at line 41 of file BonBqpdSolver.cpp.
Referenced by Couenne::CouenneVTObject::infeasibility().
Definition at line 41 of file BonBqpdSolver.cpp.
struct { ... } epsc |
struct { ... } EPSC |
Definition at line 46 of file BonBqpdSolver.cpp.
Definition at line 47 of file BonBqpdSolver.cpp.
Definition at line 47 of file BonBqpdSolver.cpp.
struct { ... } repc |
struct { ... } REPC |
Definition at line 52 of file BonBqpdSolver.cpp.
Definition at line 52 of file BonBqpdSolver.cpp.
struct { ... } refactorc |
struct { ... } REFACTORC |
Definition at line 57 of file BonBqpdSolver.cpp.
struct { ... } vstepc |
struct { ... } VSTEPC |
Definition at line 62 of file BonBqpdSolver.cpp.
Definition at line 62 of file BonBqpdSolver.cpp.
Definition at line 62 of file BonBqpdSolver.cpp.
struct { ... } hessc |
Referenced by Bonmin::BqpdSolver::cachedInfo::optimize().
struct { ... } HESSC |
Referenced by Bonmin::BqpdSolver::cachedInfo::optimize().
Definition at line 67 of file BonBqpdSolver.cpp.
Definition at line 67 of file BonBqpdSolver.cpp.
struct { ... } scalec |
Referenced by Bonmin::BqpdSolver::cachedInfo::optimize().
struct { ... } SCALEC |
Referenced by Bonmin::BqpdSolver::cachedInfo::optimize().
Definition at line 72 of file BonBqpdSolver.cpp.
Definition at line 72 of file BonBqpdSolver.cpp.
Definition at line 72 of file BonBqpdSolver.cpp.
Definition at line 72 of file BonBqpdSolver.cpp.
Referenced by Couenne::exprSum::impliedBoundSum(), and MC_solution::structure_switch_improve().
Definition at line 72 of file BonBqpdSolver.cpp.
Definition at line 72 of file BonBqpdSolver.cpp.
Definition at line 72 of file BonBqpdSolver.cpp.
Definition at line 72 of file BonBqpdSolver.cpp.
Definition at line 72 of file BonBqpdSolver.cpp.
Definition at line 72 of file BonBqpdSolver.cpp.
Definition at line 72 of file BonBqpdSolver.cpp.
Definition at line 72 of file BonBqpdSolver.cpp.
Definition at line 72 of file BonBqpdSolver.cpp.
struct { ... } bqpdc |
struct { ... } BQPDC |
Definition at line 77 of file BonBqpdSolver.cpp.
Referenced by Couenne::combine(), Couenne::compthres(), Couenne::contourCut(), Couenne::curvDistance(), Couenne::CouenneVTObject::infeasibility(), Bonmin::MilpRounding::solution(), and Bonmin::CurvBranchingSolver::solveFromHotStart().
struct { ... } alphac |
struct { ... } ALPHAC |
Definition at line 82 of file BonBqpdSolver.cpp.
Definition at line 82 of file BonBqpdSolver.cpp.
Referenced by OSResult::addTimingInformation(), Couenne::CouenneCutGenerator::createCut(), main(), MC_generate_shortest_path_cycles(), and Couenne::CouenneAmplInterface::readnl().
Definition at line 82 of file BonBqpdSolver.cpp.
Definition at line 82 of file BonBqpdSolver.cpp.
Referenced by MCF3_lp::compute_lower_bound(), MCF2_lp::compute_lower_bound(), MCF1_lp::compute_lower_bound(), Couenne::exprSum::impliedBoundSum(), and Couenne::exprDiv::isInteger().
Definition at line 82 of file BonBqpdSolver.cpp.
Definition at line 82 of file BonBqpdSolver.cpp.
Definition at line 82 of file BonBqpdSolver.cpp.
Definition at line 82 of file BonBqpdSolver.cpp.
Referenced by check_prod_row_barQ(), QuadraticCuts::checkPreviousQuadraticEVCutsOnCurrentSolution(), CutGen::compareSparsify(), QuadraticCuts::computeEigenvectorsFromCurrentSolution(), fprintvecmat(), CutGen::generateCuts(), CutGen::genSDPcut(), get_barQ(), get_LPsol_vec_from_vvT(), orthoCutGen(), print_barQ(), print_mat_from_vec(), print_mat_from_vvT(), CutGen::sparsify(), CutGen::sparsify2(), CutGen::sparsify_new(), and QuadraticCuts::updateSolution().
Definition at line 82 of file BonBqpdSolver.cpp.
Definition at line 82 of file BonBqpdSolver.cpp.
Definition at line 82 of file BonBqpdSolver.cpp.
Referenced by Couenne::exprSum::impliedBound(), and Couenne::CouenneProblem::linStandardize().
Definition at line 83 of file BonBqpdSolver.cpp.
Definition at line 83 of file BonBqpdSolver.cpp.
Referenced by Couenne::exprQuad::computeQuadFiniteBound(), Couenne::exprQuad::impliedBound(), and Couenne::CouenneProblem::linStandardize().
Definition at line 83 of file BonBqpdSolver.cpp.
Definition at line 83 of file BonBqpdSolver.cpp.
Definition at line 83 of file BonBqpdSolver.cpp.
Definition at line 83 of file BonBqpdSolver.cpp.
Definition at line 83 of file BonBqpdSolver.cpp.
Definition at line 83 of file BonBqpdSolver.cpp.
Definition at line 83 of file BonBqpdSolver.cpp.
Definition at line 83 of file BonBqpdSolver.cpp.
Definition at line 83 of file BonBqpdSolver.cpp.
Definition at line 83 of file BonBqpdSolver.cpp.
Definition at line 83 of file BonBqpdSolver.cpp.
Definition at line 83 of file BonBqpdSolver.cpp.
Definition at line 83 of file BonBqpdSolver.cpp.
struct { ... } sparsec |
struct { ... } SPARSEC |
Definition at line 88 of file BonBqpdSolver.cpp.
Definition at line 88 of file BonBqpdSolver.cpp.
Referenced by Bonmin::TNLP2FPNLP::get_constraints_linearity(), Bonmin::TNLP2FPNLP::get_starting_point(), and os_dtoa().
Definition at line 88 of file BonBqpdSolver.cpp.
Definition at line 88 of file BonBqpdSolver.cpp.
Definition at line 88 of file BonBqpdSolver.cpp.
Definition at line 88 of file BonBqpdSolver.cpp.
Referenced by Couenne::exprQuad::alphaConvexify(), Bonmin::CurvatureEstimator::Compute_dTHLagd(), Bonmin::CurvatureEstimator::ComputeNullSpaceCurvature(), Bonmin::CurvatureEstimator::PrepareNewMatrixStructure(), and Bonmin::CurvatureEstimator::PrepareNewMatrixValues().
struct { ... } factorc |
struct { ... } FACTORC |
Definition at line 93 of file BonBqpdSolver.cpp.
struct { ... } mxm1c |
struct { ... } MXM1C |
Definition at line 98 of file BonBqpdSolver.cpp.
Referenced by BCP_lp_add_from_local_cut_pool(), BCP_lp_pack_noncore_cuts(), BCP_lp_select_branching_object(), BCP_problem_core::BCP_problem_core(), Couenne::CouenneProblem::checkCons(), Couenne::CouenneProblem::checkNLP(), Couenne::exprDiv::closestFeasible(), Couenne::expression::compare(), cpp_genalea(), MC_problem::create_adj_lists(), diff(), BCP_parameter_set< BCP_tm_par >::expand(), Couenne::ExprHess::ExprHess(), Couenne::ExprJac::ExprJac(), Couenne::findIntersection(), hexnan(), Couenne::exprDiv::impliedBound(), Bonmin::Cuts::insert(), dataset::isNumber(), main(), match(), mult(), os_strtod(), populateProblem(), printCmpSol(), process_Msg_CutListDelete(), process_Msg_CutListRequest(), process_Msg_VarListRequest(), Couenne::projectSeg(), Couenne::exprAux::properObject(), Bonmin::OsiTMINLPInterface::resolveForCost(), Bonmin::OsiTMINLPInterface::resolveForRobustness(), Bonmin::MilpRounding::solution(), Bonmin::HeuristicDiveMIP::solution(), MC_problem::unpack(), and BCP_ts_prob::~BCP_ts_prob().
struct { ... } minorc |
struct { ... } MINORS |