Package dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp

Quadratic programming with explicit objective and constraint conventions.

See: Description

Interface Summary

Interface	Description
QPSolution	This is a solution to a quadratic programming problem.

Class Summary

Class	Description
QPSimpleMinimizer	These are the utility functions to solve simple quadratic programming problems that admit analytical solutions.

Exception Summary

Exception	Description
QPException	This is the exception thrown when there is an error solving a quadratic programming problem.
QPInfeasible	This is the exception thrown by a quadratic programming solver when the quadratic programming problem is infeasible, i.e., no solution.

Package dev.nm.solver.multivariate.constrained.convex.sdp.socp.qp Description

Quadratic programming with explicit objective and constraint conventions.

QPSimpleMinimizer provides a complete small quadratic example. Its objective includes the factor one half before the Hessian term. Select a solver that supports your constraints; the simple convenience solver handles unconstrained or equality-constrained problems. Inspect solution uniqueness and handle infeasibility.