#include "BonminConfig.h"
#include "BonBqpdSolver.hpp"
#include "BonBqpdWarmStart.hpp"
#include "CoinTime.hpp"
Include dependency graph for BonBqpdSolver.cpp:
Go to the source code of this file.
#define InitializeAll |
Definition at line 18 of file BonBqpdSolver.cpp.
typedef Bonmin::BqpdSolver::fint fint |
Definition at line 20 of file BonBqpdSolver.cpp.
typedef Bonmin::BqpdSolver::real real |
Definition at line 21 of file BonBqpdSolver.cpp.
void F77_FUNC | ( | bqpd | , | |
BQPD | ||||
) |
Definition at line 25 of file BonBqpdSolver.cpp.
Referenced by exprMul::balancedMul(), BCP_problem_core::BCP_problem_core(), CouenneDisjCuts::generateDisjCuts(), OSInstance::getADSparsityHessian(), getConstraintMatrix(), OSInstance::getDenseObjectiveCoefficients(), Bonmin::AmplTMINLP::getLinearPartOfObjective(), Bonmin::TMINLP2TNLP::gutsOfCopy(), OSInstance::initObjGradients(), BCP_lp_user::load_problem(), main(), exprQuad::print(), Bonmin::AmplTMINLP::read_priorities(), Bonmin::BqpdSolver::ReOptimizeTNLP(), CoinSolver::setSolverOptions(), Bonmin::TMINLP2TNLP::TMINLP2TNLP(), and Bonmin::TNLPSolver::zeroDimension().
Definition at line 25 of file BonBqpdSolver.cpp.
Referenced by OSInstance::addQTermsToExressionTree(), exprQuad::alphaConvexify(), Balloc(), BCP_tm_balance_data(), BCP_vec_change< char >::BCP_vec_change(), CoinSolver::buildSolverInstance(), OSnLNodeAllDiff::calculateFunction(), Bonmin::OaDecompositionBase::solverManip::cloneOther(), exprPow::closestFeasible(), ipopt_cppad_nlp::compute_index_h_lag(), ipopt_cppad_nlp::compute_index_jac_fg(), SparseMatrix::display(), distance(), ipopt_cppad_nlp::eval_f(), ipopt_cppad_nlp::eval_g(), ipopt_cppad_nlp::eval_grad_f(), ipopt_cppad_nlp::eval_h(), Bonmin::TNLP2FPNLP::eval_h(), ipopt_cppad_nlp::eval_jac_g(), Bonmin::TNLP2FPNLP::eval_jac_g(), BCP_parameter_set< BCP_tm_par >::expand(), find_tree_manager(), FPGeneralIntegers(), BB_lp::generate_heuristic_solution(), exprPow::generateCuts(), exprDiv::generateCuts(), Bonmin::OaNlpOptim::generateCuts(), IpoptProblem::get_starting_point(), BonminProblem::get_starting_point(), exprPow::getBounds(), OSInstance::getFirstOrderResults(), OSOption::getInitBasisStatusDense(), OSOption::getInitConValuesDense(), OSOption::getInitDualVarLowerBoundsDense(), OSOption::getInitDualVarUpperBoundsDense(), OSOption::getInitObjLowerBoundsDense(), OSOption::getInitObjUpperBoundsDense(), OSOption::getInitObjValuesDense(), OSOption::getInitVarValuesDense(), OSOption::getInitVarValuesStringDense(), OSOption::getIntegerVariableBranchingWeightsDense(), OSInstance::getSecondOrderResults(), OSInstance::getSparseJacobianFromRowMajor(), hi0bits(), exprPow::impliedBound(), ipopt_cppad_nlp::ipopt_cppad_nlp(), Bonmin::OaDecompositionBase::solverManip::isDifferentOnIntegers(), lo0bits(), KnitroProblem::loadProblemIntoKnitro(), main(), MCF1_adjust_bounds(), MCF2_adjust_bounds(), MCF3_adjust_bounds(), mult(), os_dtoa_format(), CouenneDisjCuts::OsiCuts2MatrVec(), CouenneDisjCuts::OsiSI2MatrVec(), powNewton(), OS_lp::process_lp_result(), s2b(), exprPow::selectBranch(), OSInstance::setLinearConstraintCoefficients(), OSInstance::setQuadraticTerms(), CoinSolver::setSolverOptions(), exprOp::shrink_arglist(), ampl_utils::sos_kludge(), BB_lp::test_feasibility(), testOa(), trigNewton(), and OSResult::~OSResult().
Definition at line 25 of file BonBqpdSolver.cpp.
Referenced by b2d(), cmp(), OSnLNodeErf::constructADTape(), diff(), mult(), projectSeg(), exprQuad::quadCuts(), ratio(), and ulp().
Definition at line 25 of file BonBqpdSolver.cpp.
Referenced by 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(), exprPow::closestFeasible(), exprMul::closestFeasible(), exprDiv::closestFeasible(), MCF3_lp::compute_lower_bound(), MCF2_lp::compute_lower_bound(), MCF1_lp::compute_lower_bound(), CouenneCutGenerator::createCut(), d2b(), OS_lp::display_lp_solution(), BCP_lp_user::display_lp_solution(), draw_cuts(), BB_lp::generate_heuristic_solution(), exprSub::generateCuts(), exprPow::generateCuts(), exprLog::generateCuts(), exprExp::generateCuts(), exprDiv::generateCuts(), CouenneCutGenerator::generateCuts(), CouenneProblem::getIntegerCandidate(), hexnan(), hi0bits(), CouenneSolverInterface::initialSolve(), exprPow::isCuttable(), exprLog::isCuttable(), exprInv::isCuttable(), exprExp::isCuttable(), exprAbs::isCuttable(), lo0bits(), lshift(), main(), mult(), multadd(), exprQuad::operator()(), exprVar::operator()(), 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(), CouenneDisjCuts::OsiSI2MatrVec(), BCP_lp_user::pack_primal_solution(), OS_lp::process_lp_result(), readProblem(), CouenneProblem::redCostBT(), CouenneProblem::reformulate(), exprQuad::replace(), exprGroup::replace(), exprUnary::replace(), exprOp::replace(), CouenneSolverInterface::resolve(), s2b(), OS_lp::select_branching_candidates(), BB_lp::select_branching_candidates(), Bonmin::BqpdSolver::setWarmStart(), CouenneSolverInterface::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(), BB_lp::test_feasibility(), BCP_lp_user::test_full(), BCP_lp_user::test_integral(), testFp(), ulp(), CouenneSolver::writeResult(), CoinSolver::writeResult(), and BonminSolver::writeResult().
Definition at line 25 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(), CouenneProblem::readCutoff(), CouenneProblem::readOptimum(), Bonmin::OsiTMINLPInterface::resolveForCost(), Bonmin::OsiTMINLPInterface::resolveForRobustness(), MCF3_lp::test_feasibility(), MCF2_lp::test_feasibility(), MCF1_lp::test_feasibility(), trigEnvelope(), CouenneProblem::writeAMPL(), and CouenneProblem::writeGAMS().
Definition at line 25 of file BonBqpdSolver.cpp.
Referenced by Bonmin::BqpdSolver::cachedInfo::optimize().
Definition at line 25 of file BonBqpdSolver.cpp.
Referenced by DepNode::createOrder(), exprQuad::fillDepSet(), exprGroup::fillDepSet(), exprVar::fillDepSet(), exprUnary::fillDepSet(), exprOp::fillDepSet(), and exprCopy::fillDepSet().
Definition at line 25 of file BonBqpdSolver.cpp.
Referenced by ipopt_cppad_nlp::eval_f(), ipopt_cppad_nlp::eval_g(), OSInstance::getADSparsityHessian(), main(), exprQuad::rank(), exprGroup::rank(), exprOp::rank(), and rv_alloc().
Definition at line 25 of file BonBqpdSolver.cpp.
Referenced by CouenneProblem::addAuxiliary(), b2d(), MCF3_tm::create_root(), MCF2_tm::create_root(), MCF1_tm::create_root(), ipopt_cppad_nlp::eval_grad_f(), ipopt_cppad_nlp::eval_h(), exprVar::generateCuts(), exprConst::generateCuts(), exprCopy::generateCuts(), exprSum::generateCuts(), exprSub::generateCuts(), exprCos::generateCuts(), exprSin::generateCuts(), exprQuad::generateCuts(), exprPow::generateCuts(), exprOpp::generateCuts(), exprMul::generateCuts(), exprGroup::generateCuts(), exprDiv::generateCuts(), exprAbs::generateCuts(), main(), exprQuad::quadCuts(), exprQuad::replace(), exprGroup::replace(), exprUnary::replace(), exprOp::replace(), CouenneConstraint::standardize(), and trigEnvelope().
Definition at line 25 of file BonBqpdSolver.cpp.
Referenced by BCP_warmstart_dual::as_change(), BCP_lp_add_from_local_var_pool(), BCP_tm_create_core(), CheckHessianUpper(), Bonmin::OaDecompositionBase::solverManip::cloneOther(), exprQuad::compare(), exprGroup::compare(), 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(), CouenneVarObject::computeBranchingPoint(), Bonmin::CutStrengthener::ComputeCuts(), Bonmin::CurvatureEstimator::ComputeNullSpaceCurvature(), CouExpr::CouExpr(), CouenneCutGenerator::createCut(), enhancedOA(), exprConst::exprConst(), exprCopy::exprCopy(), Bonmin::OsiTMINLPInterface::extractLinearRelaxation(), CouenneObject::feasibleRegion(), FP(), FPGeneralIntegers(), exprGroup::generateCuts(), Bonmin::OaNlpOptim::generateCuts(), OSInstance::getADSparsityHessian(), exprLog::getBounds(), getOriginal(), Bonmin::OsiTMINLPInterface::getOuterApproximation(), Bonmin::CutStrengthener::HandleOneCut(), Bonmin::OsiTMINLPInterface::isFreeBinary(), iteratedFP(), main(), BMSearchTreeCompareBest::operator()(), CouExpr::operator=(), BCP_tm_stat::print(), BCP_tm_prob::process_message(), exprQuad::quadCuts(), Bonmin::register_OA_options(), Bonmin::BabSetupBase::registerAllOptions(), Bonmin::EcpCuts::registerOptions(), Bonmin::LpBranchingSolver::registerOptions(), CouenneSolverInterface::resolve(), rootQ(), MCF3_lp::select_branching_candidates(), MCF2_lp::select_branching_candidates(), MCF1_lp::select_branching_candidates(), Bonmin::TNLP2FPNLP::set_cutoff(), BCP_parameter_set< BCP_tm_par >::set_default_entries(), BCP_parameter_set< BCP_lp_par >::set_default_entries(), Bonmin::IpoptSolver::setMinlpDefaults(), KnitroSolver::solve(), CoinSolver::solve(), Bonmin::LpBranchingSolver::solveFromHotStart(), ampl_utils::sos_kludge(), Bonmin::CutStrengthener::StrengthenCut(), MCF3_lp::test_feasibility(), MCF2_lp::test_feasibility(), MCF1_lp::test_feasibility(), BCP_var::test_inactive(), testFp(), testOa(), testOptimAndSolutionQuery(), testSetMethods(), CouenneSolverInterface::tightenBoundsCLP(), BM_lp::unpack_module_data(), and Bonmin::TNLPSolver::zeroDimension().
Definition at line 25 of file BonBqpdSolver.cpp.
Definition at line 25 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(), Bonmin::OaFeasibilityChecker::performOa(), Bonmin::OACutGenerator2::performOa(), BCP_lp_user::select_branching_candidates(), testOa(), and BM_pack::unpack_user_data().
Definition at line 25 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 25 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 25 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(), CouenneSolverInterface::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 25 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 25 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* info |
Definition at line 25 of file BonBqpdSolver.cpp.
Referenced by exprQuad::alphaConvexify(), FP(), FPGeneralIntegers(), BM_lp::generate_cuts_in_lp(), main(), Bonmin::OaFeasibilityChecker::performOa(), Bonmin::OACutGenerator2::performOa(), and Bonmin::NlpSolveHeuristic::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 25 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 25 of file BonBqpdSolver.cpp.
Definition at line 34 of file BonBqpdSolver.cpp.
Definition at line 34 of file BonBqpdSolver.cpp.
Referenced by CouenneCutGenerator::createCut(), Bonmin::CouenneInterface::extractLinearRelaxation(), and CouenneProblem::tightenBounds().
Definition at line 34 of file BonBqpdSolver.cpp.
Referenced by Bonmin::BqpdSolver::cachedInfo::optimize().
Definition at line 34 of file BonBqpdSolver.cpp.
Referenced by Bonmin::BqpdSolver::cachedInfo::optimize().
Definition at line 34 of file BonBqpdSolver.cpp.
Definition at line 34 of file BonBqpdSolver.cpp.
struct { ... } wsc |
struct { ... } WSC |
Definition at line 39 of file BonBqpdSolver.cpp.
struct { ... } epsc |
struct { ... } EPSC |
Definition at line 44 of file BonBqpdSolver.cpp.
Definition at line 45 of file BonBqpdSolver.cpp.
Definition at line 45 of file BonBqpdSolver.cpp.
Definition at line 45 of file BonBqpdSolver.cpp.
struct { ... } repc |
struct { ... } REPC |
Definition at line 50 of file BonBqpdSolver.cpp.
Definition at line 50 of file BonBqpdSolver.cpp.
struct { ... } refactorc |
struct { ... } REFACTORC |
Definition at line 55 of file BonBqpdSolver.cpp.
struct { ... } vstepc |
struct { ... } VSTEPC |
Definition at line 60 of file BonBqpdSolver.cpp.
Definition at line 60 of file BonBqpdSolver.cpp.
Definition at line 60 of file BonBqpdSolver.cpp.
struct { ... } hessc |
Referenced by Bonmin::BqpdSolver::cachedInfo::optimize().
struct { ... } HESSC |
Referenced by Bonmin::BqpdSolver::cachedInfo::optimize().
Definition at line 65 of file BonBqpdSolver.cpp.
Definition at line 65 of file BonBqpdSolver.cpp.
struct { ... } scalec |
Referenced by Bonmin::BqpdSolver::cachedInfo::optimize().
struct { ... } SCALEC |
Referenced by Bonmin::BqpdSolver::cachedInfo::optimize().
Definition at line 70 of file BonBqpdSolver.cpp.
Definition at line 70 of file BonBqpdSolver.cpp.
Definition at line 70 of file BonBqpdSolver.cpp.
Definition at line 70 of file BonBqpdSolver.cpp.
Definition at line 70 of file BonBqpdSolver.cpp.
Definition at line 70 of file BonBqpdSolver.cpp.
Definition at line 70 of file BonBqpdSolver.cpp.
Definition at line 70 of file BonBqpdSolver.cpp.
Definition at line 70 of file BonBqpdSolver.cpp.
Definition at line 70 of file BonBqpdSolver.cpp.
Definition at line 70 of file BonBqpdSolver.cpp.
Definition at line 70 of file BonBqpdSolver.cpp.
struct { ... } bqpdc |
struct { ... } BQPDC |
Definition at line 75 of file BonBqpdSolver.cpp.
Referenced by contourCut(), curvDistance(), CouenneVTObject::infeasibility(), and Bonmin::CurvBranchingSolver::solveFromHotStart().
struct { ... } alphac |
struct { ... } ALPHAC |
Definition at line 80 of file BonBqpdSolver.cpp.
Definition at line 80 of file BonBqpdSolver.cpp.
Referenced by OSResult::addTimingInformation(), CouenneCutGenerator::createCut(), and main().
Definition at line 80 of file BonBqpdSolver.cpp.
Definition at line 80 of file BonBqpdSolver.cpp.
Referenced by MCF3_lp::compute_lower_bound(), MCF2_lp::compute_lower_bound(), MCF1_lp::compute_lower_bound(), exprMul::impliedBoundMul(), exprSum::impliedBoundSum(), and exprDiv::isInteger().
Definition at line 80 of file BonBqpdSolver.cpp.
Definition at line 80 of file BonBqpdSolver.cpp.
Definition at line 80 of file BonBqpdSolver.cpp.
Definition at line 80 of file BonBqpdSolver.cpp.
Definition at line 80 of file BonBqpdSolver.cpp.
Definition at line 80 of file BonBqpdSolver.cpp.
Definition at line 80 of file BonBqpdSolver.cpp.
Referenced by exprSum::impliedBound(), and CouenneProblem::linStandardize().
Definition at line 81 of file BonBqpdSolver.cpp.
Definition at line 81 of file BonBqpdSolver.cpp.
Referenced by exprQuad::computeQuadFiniteBound(), exprQuad::impliedBound(), and CouenneProblem::linStandardize().
Definition at line 81 of file BonBqpdSolver.cpp.
Definition at line 81 of file BonBqpdSolver.cpp.
Definition at line 81 of file BonBqpdSolver.cpp.
Definition at line 81 of file BonBqpdSolver.cpp.
Definition at line 81 of file BonBqpdSolver.cpp.
Definition at line 81 of file BonBqpdSolver.cpp.
Definition at line 81 of file BonBqpdSolver.cpp.
Definition at line 81 of file BonBqpdSolver.cpp.
Definition at line 81 of file BonBqpdSolver.cpp.
Definition at line 81 of file BonBqpdSolver.cpp.
Definition at line 81 of file BonBqpdSolver.cpp.
Definition at line 81 of file BonBqpdSolver.cpp.
Definition at line 81 of file BonBqpdSolver.cpp.
struct { ... } sparsec |
struct { ... } SPARSEC |
Definition at line 86 of file BonBqpdSolver.cpp.
Referenced by IpoptProblem::get_starting_point(), and BonminProblem::get_starting_point().
Definition at line 86 of file BonBqpdSolver.cpp.
Definition at line 86 of file BonBqpdSolver.cpp.
Definition at line 86 of file BonBqpdSolver.cpp.
Definition at line 86 of file BonBqpdSolver.cpp.
Referenced by exprQuad::alphaConvexify(), Bonmin::CurvatureEstimator::Compute_dTHLagd(), Bonmin::CurvatureEstimator::ComputeNullSpaceCurvature(), Bonmin::BranchingTQP::eval_f(), Bonmin::BranchingTQP::eval_g(), Bonmin::BranchingTQP::eval_grad_f(), Bonmin::CurvatureEstimator::PrepareNewMatrixStructure(), and Bonmin::CurvatureEstimator::PrepareNewMatrixValues().
struct { ... } factorc |
struct { ... } FACTORC |
Definition at line 91 of file BonBqpdSolver.cpp.
struct { ... } mxm1c |
struct { ... } MXM1C |
Definition at line 96 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(), CouenneProblem::checkNLP(), exprMul::closestFeasible(), exprDiv::closestFeasible(), expression::compare(), diff(), BCP_parameter_set< BCP_tm_par >::expand(), exprMul::getBounds(), hexnan(), exprMul::impliedBound(), exprDiv::impliedBound(), main(), match(), mult(), os_strtod(), process_Msg_CutListDelete(), process_Msg_CutListRequest(), process_Msg_VarListRequest(), projectSeg(), Bonmin::OsiTMINLPInterface::resolveForCost(), Bonmin::OsiTMINLPInterface::resolveForRobustness(), exprMul::simplify(), and BCP_ts_prob::~BCP_ts_prob().
struct { ... } minorc |
struct { ... } MINORS |