Index

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

B

basis identification
bound
constraint, [1], [2]
linear optimization
variable, [1], [2]

C

CBF format
certificate
dual, [1], [2], [3]
primal, [1], [2]
complementarity
cone
dual
quadratic, [1]
rotated quadratic, [1]
semidefinite, [1]
conic optimization, [1]
infeasibility
interior-point
termination criteria
conic quadratic optimization
constraint
bound, [1], [2]
linear optimization
matrix, [1], [2]
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
example
qo1
quadratic objective, [1]

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]
installation
requirements
troubleshooting
integer
optimizer
variable
integer feasible
solution
integer optimization, [1]
cut
delayed termination criteria
initial solution
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

license
linear constraint matrix
linear dependency
linear optimization, [1]
bound
constraint
infeasibility
interior-point
objective
simplex
termination criteria, [1]
variable
logging
integer optimizer
interior-point, [1]
optimizer, [1], [2]
simplex
lower limit
constraints
variables
LP format

M

matrix
constraint, [1], [2]
semidefinite
symmetric
MIP
see integer optimization
mixed-integer
see integer
mixed-integer optimization
see integer optimization
MPS format
free

N

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

O

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

P

parallelization
parameter
simplex
positive semidefinite
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

qo1
example
quadratic
constraint
quadratic cone, [1]
quadratic objective
example, [1]
quadratic optimization
quality
solution

R

relaxation
rotated quadratic cone, [1]

S

scaling
semidefinite
cone, [1]
infeasibility
matrix
variable, [1]
semidefinite optimization, [1]
separable convex optimization
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
solution summary, [1]
symmetric
matrix

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], [2]
dual, [1]
integer
linear optimization
semidefinite, [1]
variables
decision
lower limit
upper limit