Index

Symbols | A | B | C | D | E | F | G | H | I | J | L | M | N | O | P | Q | R | S | T | U | V | W

Symbols

-=
mosek command line option
-a
mosek command line option
-anapro
mosek command line option
-anasoli <name>
mosek command line option
-anasolo <name>
mosek command line option
-basi <name>
mosek command line option
-baso <name>
mosek command line option
-d <name> <value>
mosek command line option
-dbgmem <name>
mosek command line option
-f
mosek command line option
-h, -?
mosek command line option
-info <name>
mosek command line option
-infrepo <name>
mosek command line option
-inti <name>
mosek command line option
-into <name>
mosek command line option
-itri <name>
mosek command line option
-itro <name>
mosek command line option
-l,-L <dir>
mosek command line option
-max
mosek command line option
-min
mosek command line option
-n
mosek command line option
-out <name>
mosek command line option
-p <name>, -pari <name>
mosek command line option
-paro <name>
mosek command line option
-q <name>
mosek command line option
-r
mosek command line option
-removeitg
mosek command line option
-rout <name>
mosek command line option
-sen <file>
mosek command line option
-silent
mosek command line option
-toconic
mosek command line option
-v
mosek command line option
-w
mosek command line option
-x
mosek command line option

A

AMPL
outlev
wantsol
arguments
command line tool

B

basis identification
basis type
sensitivity analysis
bound
constraint, [1]
variable, [1]

C

CBF format
certificate
dual, [1], [2], [3]
primal, [1], [2]
command line tool
arguments
complementarity
cone
dual
quadratic
rotated quadratic
semidefinite
conic optimization
infeasibility
interior-point
termination criteria
constraint
bound, [1]
matrix, [1]
quadratic
constraints
lower limit
upper limit
convex interior-point
optimizers
cut

D

decision
variables
determinism
dual
certificate, [1], [2], [3]
cone
feasible
infeasible, [1], [2], [3], [4]
problem, [1], [2]
variable, [1]
duality
conic
gap
linear
semidefinite
dualizer

E

eliminator

F

feasible
dual
primal, [1], [2]
problem
format
CBF
LP
MPS
OPF
OSiL
json
sol
task

G

gap
duality

H

hot-start

I

infeasibility, [1], [2]
conic optimization
linear optimization
semidefinite
infeasible
dual, [1], [2], [3], [4]
primal, [1], [2], [3], [4], [5]
problem, [1], [2], [3]
infeasible problems
installation
requirements
troubleshooting
integer
optimizer
integer feasible
solution
integer optimization
cut
delayed termination criteria
objective bound
optimality gap
relaxation
termination criteria
tolerance
integer optimizer
logging
interior-point
conic optimization
linear optimization
logging, [1]
optimizer, [1]
termination criteria, [1]
interior-point optimizer

J

json format

L

linear dependency
linear optimization
infeasibility
interior-point
simplex
termination criteria, [1]
linearity interval
logging
integer optimizer
interior-point, [1]
optimizer, [1], [2]
simplex
lower limit
constraints
variables
LP format

M

matrix
constraint, [1]
MIP
see integer optimization
mixed-integer
see integer
mosek command line option
-=
-a
-anapro
-anasoli <name>
-anasolo <name>
-basi <name>
-baso <name>
-d <name> <value>
-dbgmem <name>
-f
-h, -?
-info <name>
-infrepo <name>
-inti <name>
-into <name>
-itri <name>
-itro <name>
-l,-L <dir>
-max
-min
-n
-out <name>
-p <name>, -pari <name>
-paro <name>
-q <name>
-r
-removeitg
-rout <name>
-sen <file>
-silent
-toconic
-v
-w
-x
MPS format
free

N

near-optimal
solution, [1], [2]
numerical issues
presolve
scaling
simplex

O

objective
objective bound
objective vector
OPF format
optimal
solution
optimality gap
optimization
conic quadratic
linear
semidefinite
optimizer
determinism
integer
interior-point, [1]
logging, [1], [2]
parallelization
selection, [1]
simplex
optimizers
convex interior-point
OSiL format
outlev
AMPL

P

pair sensitivity analysis
optimal partition type
parallelization
parameter
simplex
parameter file
presolve
eliminator
linear dependency check
numerical issues
primal
certificate, [1], [2]
feasible, [1], [2]
infeasible, [1], [2], [3], [4], [5]
problem, [1], [2]
solution
primal-dual
problem, [1]
solution
problem
dual, [1], [2]
feasible
infeasible, [1], [2], [3]
primal, [1], [2]
primal-dual, [1]
unbounded

Q

quadratic
constraint
quadratic cone
quadratic optimization
quality
solution

R

relaxation
rotated quadratic cone

S

scaling
semidefinite
cone
infeasibility
variable
semidefinite optimization
sensitivity analysis
basis type
shadow price
simplex
linear optimization
logging
numerical issues
optimizer
parameter
termination criteria
sol format
solution
file format
integer feasible
near-optimal, [1], [2]
optimal
primal
primal-dual
quality

T

task format
termination criteria
conic optimization
delayed
integer optimization
interior-point, [1]
linear optimization, [1]
simplex
tolerance, [1], [2]
thread
tolerance
integer optimization
termination criteria, [1], [2]
troubleshooting
installation

U

unbounded
problem
upper limit
constraints
variables

V

variable
bound, [1]
dual, [1]
semidefinite
variables
decision
lower limit
upper limit

W

wantsol
AMPL