Modifier and Type | Interface and Description |
---|---|
interface |
EqualityConstraints
The domain of an optimization problem may be restricted by equality constraints.
|
interface |
GreaterThanConstraints
The domain of an optimization problem may be restricted by greater-than or equal-to constraints.
|
interface |
LessThanConstraints
The domain of an optimization problem may be restricted by less-than or equal-to constraints.
|
Modifier and Type | Method and Description |
---|---|
static Vector |
ConstraintsUtils.evaluate(Constraints constraints,
Vector x)
Evaluates the constraints.
|
static boolean |
ConstraintsUtils.isSatisfied(Constraints constraints,
Vector x)
Checks if the constraints are satisfied.
|
static boolean |
ConstraintsUtils.isSatisfied(Constraints constraints,
Vector x,
double epsilon)
Checks if the constraints are satisfied.
|
Modifier and Type | Class and Description |
---|---|
class |
GeneralConstraints
The real-valued constraints define the domain (feasible regions) for a real-valued objective
function in a constrained optimization problem.
|
class |
GeneralEqualityConstraints
This is the collection of equality constraints for an optimization problem.
|
class |
GeneralGreaterThanConstraints
This is the collection of greater-than-or-equal-to constraints for an optimization problem.
|
class |
GeneralLessThanConstraints
This is the collection of less-than or equal-to constraints for an optimization problem.
|
Modifier and Type | Class and Description |
---|---|
class |
LinearConstraints
This is a collection of linear constraints for a real-valued optimization problem.
|
class |
LinearEqualityConstraints
This is a collection of linear equality constraints.
|
class |
LinearGreaterThanConstraints
This is a collection of linear greater-than-or-equal-to constraints.
|
class |
LinearLessThanConstraints
This is a collection of linear less-than-or-equal-to constraints.
|
class |
LowerBoundConstraints
This is a lower bound constraints such that for all xi's,
xi ≥ b
|
class |
NonNegativityConstraints
These constraints ensures that for all variables are non-negative.
|
class |
UpperBoundConstraints
This is an upper bound constraints such that for all xi's,
xi ≤ b
|
Modifier and Type | Class and Description |
---|---|
static class |
SDPDualProblem.EqualityConstraints
This is the collection of equality constraints:
\[
\sum_{i=1}^{p}y_i\mathbf{A_i}+\textbf{S} = \textbf{C}, \textbf{S} \succeq \textbf{0}
\]
|
Modifier and Type | Class and Description |
---|---|
static class |
SOCPDualProblem.EqualityConstraints |
Modifier and Type | Field and Description |
---|---|
protected Constraints |
MultiplierPenalty.constraints
the constraint/cost functions
|
Constructor and Description |
---|
MultiplierPenalty(Constraints constraints)
Construct a multiplier penalty function from a collection of constraints.
|
MultiplierPenalty(Constraints constraints,
double weight)
Construct a multiplier penalty function from a collection of constraints.
|
MultiplierPenalty(Constraints constraints,
double[] weights)
Construct a multiplier penalty function from a collection of constraints.
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.