| Package | Description |
|---|---|
| dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp |
Quadratic programming with explicit objective and constraint conventions.
|
| dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.activeset | |
| dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp.solver.socp |
| Modifier and Type | Method and Description |
|---|---|
static QPSolution |
QPSimpleMinimizer.solve(QuadraticFunction f)
Solves an unconstrained quadratic programming problem of this form.
\[
\min_x \left \{ \frac{1}{2} \times x'Hx + x'p \right \}
\]
|
static QPSolution |
QPSimpleMinimizer.solve(QuadraticFunction f,
double epsilon)
Solves an unconstrained quadratic programming problem of this form.
\[
\min_x \left \{ \frac{1}{2} \times x'Hx + x'p \right \}
\]
|
static QPSolution |
QPSimpleMinimizer.solve(QuadraticFunction f,
LinearEqualityConstraints equal)
Solves a quadratic programming problem subject to equality constraints.
\[
\min_x \left \{ \frac{1}{2} \times x'Hx + x'p \right \}, Ax = b
\]
|
static QPSolution |
QPSimpleMinimizer.solve(QuadraticFunction f,
LinearEqualityConstraints equal,
double epsilon)
Solves a quadratic programming problem subject to equality constraints.
\[
\min_x \left \{ \frac{1}{2} \times x'Hx + x'p \right \}, Ax = b
\]
|
| Modifier and Type | Method and Description |
|---|---|
QPSolution |
QPDualActiveSetMinimizer.Solution.minimizer() |
QPSolution |
QPPrimalActiveSetMinimizer.Solution.minimizer() |
QPSolution |
QPDualActiveSetMinimizer.Solution.search()
Searches for a minimizer for the quadratic programming problem.
|
QPSolution |
QPPrimalActiveSetMinimizer.Solution.search()
Searches for a minimizer for the quadratic programming problem.
|
QPSolution |
QPDualActiveSetMinimizer.Solution.search(QPSolution... initials) |
QPSolution |
QPPrimalActiveSetMinimizer.Solution.search(QPSolution... initials) |
QPSolution |
QPPrimalActiveSetMinimizer.Solution.search(QPSolution initial)
Searches for a minimizer for the quadratic programming problem from
the given starting points.
|
QPSolution |
QPPrimalActiveSetMinimizer.Solution.search(Vector initial)
Searches for a minimizer for the quadratic programming problem.
|
| Modifier and Type | Method and Description |
|---|---|
QPSolution |
QPDualActiveSetMinimizer.Solution.search(QPSolution... initials) |
QPSolution |
QPPrimalActiveSetMinimizer.Solution.search(QPSolution... initials) |
QPSolution |
QPPrimalActiveSetMinimizer.Solution.search(QPSolution initial)
Searches for a minimizer for the quadratic programming problem from
the given starting points.
|
void |
QPDualActiveSetMinimizer.Solution.setInitials(QPSolution... initials)
No need to set initials for the dual problem.
|
void |
QPPrimalActiveSetMinimizer.Solution.setInitials(QPSolution... initials) |
| Modifier and Type | Method and Description |
|---|---|
QPSolution |
QPbySOCPMinimizer.Solution.minimizer() |
QPSolution |
QPbySOCPMinimizer1.Solution.minimizer() |
QPSolution |
QPbySOCPMinimizer.Solution.search(QPSolution... initials) |
QPSolution |
QPbySOCPMinimizer1.Solution.search(QPSolution... initials) |
| Modifier and Type | Method and Description |
|---|---|
QPSolution |
QPbySOCPMinimizer.Solution.search(QPSolution... initials) |
QPSolution |
QPbySOCPMinimizer1.Solution.search(QPSolution... initials) |
void |
QPbySOCPMinimizer.Solution.setInitials(QPSolution... initials) |
void |
QPbySOCPMinimizer1.Solution.setInitials(QPSolution... initials) |
Copyright © 2010-2026 NM Group. All Rights Reserved.