Knitro to AIMMS Mapping
Description
The table shows in the left column the parameters from Knitro that can be set in AIMMS; the right column displays for each Knitro option the associated AIMMS option.
Name in Knitro Option name in AIMMS
act_lpalg LP Algorithm
act_lpfeastol LP Feasibility Tolerance
act_lppenalty Objective Reduction
act_lppresolve LP Presolve
act_lpsolver LP Solver
act_qpalg QP Algorithm
act_qppenalty Act QPpenalty
bar_conic_enable Barrier Enable Conic
bar_directinterval Direct Step Interval
bar_feasible Feasible Mode
bar_feasmodetol Feasible Mode Activation Tolerance
bar_globalize Barrier Globalize
bar_initmu Initial Barrier Parameter Value
bar_initpi_mpec Initial Barrier Penalty Value MPEC
bar_initpt Initial Point Strategy
bar_linsys Linear System Form Used
bar_linsys_storage Linear System Memory Usage
bar_maxcorrectors Barrier Corrector Steps Limit
bar_maxcrossit Crossover Iterations Limit
bar_maxmu Barrier Maximum Mu
bar_maxrefactor Refactorization Limit
bar_mpec_heuristic Barrier MPEC Heuristic
bar_murule Barrier Parameter Strategy
bar_penaltycons Barrier Penalty Constraint Strategy
bar_penaltyrule Barrier Penalty Parameter Strategy
bar_refinement Barrier Refinement
bar_relaxcons Barrier Relax Constraints
bar_slackboundpush Barrier Slack Bound Push
bar_switchobj Barrier Switch Objective
bar_switchrule Barrier Switch Rule
bar_watchdog Barrier Watchdog
blas_numthreads Number of BLAS Threads
blasoption BLAS Option
cg_maxit Conjugate Gradient Iteration Limit
cg_pmem Conjugate Gradient Memory Limit
cg_precond Conjugate Gradient Preconditioner
cg_stoptol Conjugate Gradient Stopping Tolerance
convex Mark as Convex
datacheck Data Check
debug Debugging Output
delta Initial Trust Scaling Factor
feastol Relative Feasibility Tolerance
feastol_abs Absolute Feasibility Tolerance
findiff_estnoise Estimate Noise in the Model
findiff_numthreads Number of Gradient Computation Threads
fstopval Objective Goal
ftol Relative Improvement Tolerance
ftol_iters Relative Improvement Iterations
gradopt Gradient Computation Method
hessopt Hessian Computation Method
honorbnds Honor Bounds
infeastol Infeasibility Tolerance
infeastol_iters Infeasibility Tolerance Iteration Limit
initpenalty Initial Penalty Value
linesearch Linesearch Strategy
linesearch_maxtrials Linesearch Trials Limit
linsolver Linear Solver
linsolver_maxitref Linear System Max Iterative Refinements
linsolver_nodeamalg Linear Solver Node Amalgamation
linsolver_numthreads Number of Linear System Threads
linsolver_ooc Linear Solver Out of Core
linsolver_ordering Linear Solver Ordering
linsolver_pivottol Initial Pivot Treshold
linsolver_scaling Linear Solver Scaling
lmsize Limited Memory Size
ma_outsub Multi Algorithm Output
ma_terminate Multi Algorithm Termination
maxfevals Function Evaluations Limit
maxit Iteration Limit in ‘Solvers general’
maxtime_cpu Time Limit in ‘Solvers general’
mip_branchrule MIP Branching Rule
mip_clique Clique Cuts
mip_cut_flowcover Flow Cover Cuts
mip_cut_probing Probing Cuts
mip_cutoff MIP Objective Cutoff Value
mip_debug Debugging MIP output
mip_gomory Gomory Cuts
mip_gub_branch MIP GUB Branch
mip_heuristic MIP Heuristic
mip_heuristic_diving MIP Heuristic Diving
mip_heuristic_feaspump MIP Heuristic Feasibility Pump
mip_heuristic_lns MIP Heuristic Large Neighborhood Search
mip_heuristic_localsearch MIP Heuristic Local Search
mip_heuristic_maxit MIP Heuristic Iteration Limit
mip_heuristic_misqp MIP MISQP Heuristic
mip_heuristic_mpec MIP Heuristic MPEC
mip_heuristic_strategy MIP Heuristic Strategy
mip_heuristic_terminate MIP Heuristic Terminate
mip_implications MIP Implications
mip_integer_tol Integrality
mip_intvar_strategy MIP Integer Variables Strategy
mip_knapsack Knapsack Cuts
mip_liftproject Lift and Project Cuts
mip_lpalg MIP Algorithm
mip_maxnodes Maximal Number of Nodes
mip_maxsolves Maximal Number of Subproblem Solves
mip_method MIP Method
mip_mir MIR Cuts
mip_multistart MIP Multistart
mip_nodealg Node Algorithm
mip_numthreads Number of MIP Threads
mip_outinterval MIP Output Level
mip_pseudoinit MIP Pseudo Cost Initialization
mip_relaxable MIP Integer Variables Relaxable
mip_restart MIP Restart
mip_rootalg MIP Start Algorithm
mip_rounding MIP Rounding
mip_selectdir Node Selection_Direction
mip_selectrule Node Selection
mip_strong_candlim Strong Branching Candidates Limit
mip_strong_level Strong Branching Level
mip_strong_maxit Strong Branching Iteration Limit
mip_terminate MIP Terminate
mip_zerohalf Zero Half Cuts
ms_deterministic Multistart Deterministic
ms_enable Multistart
ms_intpt_cluster Multistart Initial Points Cluster
ms_maxbndrange Multistart Range Unbounded Variable
ms_maxsolves Number of Multistart Points
ms_num_to_save Number of Best Solutions
ms_numthreads Number of Multistart Threads
ms_savetol Solution Distance
ms_seed Multistart Seed
ms_startptrange Multistart Range
ms_terminate Multistart Termination Condition
ncvx_qcqp_init QP and QCQP Initialization Strategy
numthreads Number of Threads
objrange Unboundedness Range
opttol Relative Optimality Tolerance
opttol_abs Absolute Optimality Tolerance
outlev Status File Display
numthreads Number of Threads
presolve Presolve
presolve_initpt Presolve Initial Point
presolve_level Presolve Level
presolve_passes Presolve Passes
presolve_tol Presolve Tolerance
presolveop_redundant Presolve Redundant Constraints
presolveop_substitution Presolve Substitution
presolveop_substitution_tol Presolve Substitution Tolerance
presolveop_tighten Tighten Variable Bounds
restarts Restarts
restarts_maxit Restarts Iteration Limit
scale Scaling
scale_vars Scale Variables
strat_warm_start Warm Start Strategy
tuner Tuner
tuner_maxtime_cpu Tuner Time Limit
tuner_outsub Tuner Output
tuner_terminate Tuner Terminate
xtol Solution Progress Tolerance
xtol_iters Solution Progress Iterations