Class BasePrimitiveSolver

java.lang.Object

org.ojalgo.optimisation.GenericSolver

org.ojalgo.optimisation.convex.ConvexSolver

org.ojalgo.optimisation.convex.BasePrimitiveSolver

All Implemented Interfaces:

Optimisation, Optimisation.Solver, UpdatableSolver

Direct Known Subclasses:

ConstrainedSolver, UnconstrainedSolver

abstract class BasePrimitiveSolver
extends ConvexSolver
implements UpdatableSolver

Nested Class Summary

Nested classes/interfaces inherited from class ConvexSolver

ConvexSolver.Builder, ConvexSolver.Configuration, ConvexSolver.ModelIntegration

Nested classes/interfaces inherited from interface Optimisation

Optimisation.Constraint, Optimisation.ConstraintType, Optimisation.Integration<M,S>, Optimisation.Model, Optimisation.Objective, Optimisation.Options, Optimisation.ProblemStructure, Optimisation.Result, Optimisation.Sense, Optimisation.Solver, Optimisation.State

Field Summary

Fields

Modifier and Type	Field	Description
(package private) static final PhysicalStore.Factory<Double, R064Store>	MATRIX_FACTORY
private final ConvexData<Double>	myMatrices
private boolean	myPatchedQ
private final R064Store	mySolutionX
private final MatrixDecomposition.Solver<Double>	mySolverGeneral
private final MatrixDecomposition.Solver<Double>	mySolverQ
private boolean	myZeroQ
private static final String	Q_NOT_POSITIVE_SEMIDEFINITE
private static final String	Q_NOT_SYMMETRIC

Fields inherited from class ConvexSolver

INTEGRATION

Fields inherited from class GenericSolver

options

Constructor Summary

Constructors

Constructor	Description
BasePrimitiveSolver(ConvexData<Double> convexData, Optimisation.Options optimisationOptions)

Method Summary

Modifier and Type	Method	Description
(package private) static ConvexSolver.Builder	builder(MatrixStore<Double>[] matrices)
protected Optimisation.Result	buildResult()
protected boolean	computeGeneral(Access2D.Collectable<Double, ? super TransformableRegion<Double>> matrix)
protected int	countEqualityConstraints()
protected int	countInequalityConstraints()
protected int	countVariables()
void	dispose()	Cleanup when a solver instance is no longer needed.
protected double	evaluateFunction(Access1D<?> solution)
protected MatrixStore<Double>	extractSolution()
ConvexData<Double>	getEntityMap()
protected abstract Access2D.Collectable<Double, ? super TransformableRegion<Double>>	getIterationKKT()
protected abstract Access2D.Collectable<Double, ? super TransformableRegion<Double>>	getIterationRHS()
protected MatrixStore<Double>	getMatrixAE()
protected SparseArray<Double>	getMatrixAE(int row)
protected RowsSupplier<Double>	getMatrixAE(int[] rows)
protected MatrixStore<Double>	getMatrixAI()
protected SparseArray<Double>	getMatrixAI(int row)
protected RowsSupplier<Double>	getMatrixAI(int[] rows)
protected MatrixStore<Double>	getMatrixBE()
protected MatrixStore<Double>	getMatrixBI()
protected double	getMatrixBI(int row)
protected MatrixStore<Double>	getMatrixBI(int[] selector)
protected MatrixStore<Double>	getMatrixC()
protected PhysicalStore<Double>	getMatrixQ()
protected int	getRankGeneral()
protected MatrixStore<Double>	getSolutionGeneral(Access2D.Collectable<Double, ? super PhysicalStore<Double>> rhs)
protected MatrixStore<Double>	getSolutionGeneral(Access2D.Collectable<Double, ? super PhysicalStore<Double>> rhs, PhysicalStore<Double> preallocated)
protected MatrixStore<Double>	getSolutionQ(Access2D.Collectable<Double, ? super PhysicalStore<Double>> rhs)
protected MatrixStore<Double>	getSolutionQ(Access2D.Collectable<Double, ? super PhysicalStore<Double>> rhs, PhysicalStore<Double> preallocated)
protected PhysicalStore<Double>	getSolutionX()	Solution / Variables: [X]
protected boolean	hasEqualityConstraints()
protected boolean	hasInequalityConstraints()
protected boolean	initialise(Optimisation.Result kickStarter)
protected boolean	isIteratingPossible()
(package private) boolean	isPatchedQ()
protected boolean	isSolvableGeneral()
protected boolean	isSolvableQ()
(package private) boolean	isZeroQ()
protected abstract boolean	needsAnotherIteration()
(package private) static BasePrimitiveSolver	newSolver(ConvexData<Double> data, Optimisation.Options options)
(package private) static ConvexSolver	of(MatrixStore<Double>[] matrices)
protected abstract void	performIteration()
Optimisation.Result	solve(Optimisation.Result kickStarter)
protected boolean	solveFullKKT(PhysicalStore<Double> preallocated)
protected Optimisation.Result	solveLP()	The LP result with a Optimisation.State suitable for this solver – most likely Optimisation.State.FEASIBLE.
(package private) static ConvexObjectiveFunction<Double>	toObjectiveFunction(MatrixStore<?> mtrxQ, MatrixStore<?> mtrxC)
String	toString()
(package private) void	update(Access1D<?> mtrxC, Access1D<?> mtrxBE, Access1D<?> mtrxBI)	Specifically for use by IterativeRefinementSolver2

Methods inherited from class ConvexSolver

copy, newBuilder, newBuilder, newBuilder, newSolver

Methods inherited from class GenericSolver

countIterations, countTime, error, getClassSimpleName, getDuration, getState, incrementIterationsCount, isIterationAllowed, isLogDebug, isLogOff, isLogProgress, log, log, log, log, logProgress, printf, resetIterationsCount, setState, setValidator, validate, validate

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface Optimisation.Solver

solve

Methods inherited from interface UpdatableSolver

fixVariable, generateCutCandidates, integers, isMapped, updateRange

Field Details

Q_NOT_POSITIVE_SEMIDEFINITE

private static final String Q_NOT_POSITIVE_SEMIDEFINITE

See Also:

• Constant Field Values

Q_NOT_SYMMETRIC

private static final String Q_NOT_SYMMETRIC

See Also:

• Constant Field Values

MATRIX_FACTORY

static final PhysicalStore.Factory<Double, R064Store> MATRIX_FACTORY

myMatrices

private final ConvexData<Double> myMatrices

myPatchedQ

private boolean myPatchedQ

mySolutionX

private final R064Store mySolutionX

mySolverGeneral

private final MatrixDecomposition.Solver<Double> mySolverGeneral

mySolverQ

private final MatrixDecomposition.Solver<Double> mySolverQ

myZeroQ

private boolean myZeroQ

Constructor Details

BasePrimitiveSolver

BasePrimitiveSolver(ConvexData<Double> convexData,
 Optimisation.Options optimisationOptions)

Method Details

builder

static ConvexSolver.Builder builder(MatrixStore<Double>[] matrices)

newSolver

static BasePrimitiveSolver newSolver(ConvexData<Double> data,
 Optimisation.Options options)

of

static ConvexSolver of(MatrixStore<Double>[] matrices)

toObjectiveFunction

static ConvexObjectiveFunction<Double> toObjectiveFunction(MatrixStore<?> mtrxQ,
 MatrixStore<?> mtrxC)

dispose

public void dispose()

Description copied from interface: Optimisation.Solver

Cleanup when a solver instance is no longer needed.

Specified by:

dispose in interface Optimisation.Solver

getEntityMap

public ConvexData<Double> getEntityMap()

Specified by:

getEntityMap in interface UpdatableSolver

solve

public Optimisation.Result solve(Optimisation.Result kickStarter)

Specified by:

solve in interface Optimisation.Solver

toString

public String toString()

Overrides:

toString in class Object

buildResult

protected Optimisation.Result buildResult()

computeGeneral

protected boolean computeGeneral(Access2D.Collectable<Double, ? super TransformableRegion<Double>> matrix)

countEqualityConstraints

protected int countEqualityConstraints()

countInequalityConstraints

protected int countInequalityConstraints()

countVariables

protected int countVariables()

evaluateFunction

protected double evaluateFunction(Access1D<?> solution)

extractSolution

protected MatrixStore<Double> extractSolution()

getIterationKKT

protected abstract Access2D.Collectable<Double, ? super TransformableRegion<Double>> getIterationKKT()

getIterationRHS

protected abstract Access2D.Collectable<Double, ? super TransformableRegion<Double>> getIterationRHS()

getMatrixAE

protected MatrixStore<Double> getMatrixAE()

getMatrixAE

protected SparseArray<Double> getMatrixAE(int row)

getMatrixAE

protected RowsSupplier<Double> getMatrixAE(int[] rows)

getMatrixAI

protected MatrixStore<Double> getMatrixAI()

getMatrixAI

protected SparseArray<Double> getMatrixAI(int row)

getMatrixAI

protected RowsSupplier<Double> getMatrixAI(int[] rows)

getMatrixBE

protected MatrixStore<Double> getMatrixBE()

getMatrixBI

protected MatrixStore<Double> getMatrixBI()

getMatrixBI

protected double getMatrixBI(int row)

getMatrixBI

protected MatrixStore<Double> getMatrixBI(int[] selector)

getMatrixC

protected MatrixStore<Double> getMatrixC()

getMatrixQ

protected PhysicalStore<Double> getMatrixQ()

getRankGeneral

protected int getRankGeneral()

getSolutionGeneral

protected MatrixStore<Double> getSolutionGeneral(Access2D.Collectable<Double, ? super PhysicalStore<Double>> rhs)

getSolutionGeneral

protected MatrixStore<Double> getSolutionGeneral(Access2D.Collectable<Double, ? super PhysicalStore<Double>> rhs,
 PhysicalStore<Double> preallocated)

getSolutionQ

protected MatrixStore<Double> getSolutionQ(Access2D.Collectable<Double, ? super PhysicalStore<Double>> rhs)

getSolutionQ

protected MatrixStore<Double> getSolutionQ(Access2D.Collectable<Double, ? super PhysicalStore<Double>> rhs,
 PhysicalStore<Double> preallocated)

getSolutionX

protected PhysicalStore<Double> getSolutionX()

Solution / Variables: [X]

hasEqualityConstraints

protected boolean hasEqualityConstraints()

hasInequalityConstraints

protected boolean hasInequalityConstraints()

initialise

protected boolean initialise(Optimisation.Result kickStarter)

Returns:

true/false if the main algorithm may start or not

isIteratingPossible

protected boolean isIteratingPossible()

isSolvableGeneral

protected boolean isSolvableGeneral()

isSolvableQ

protected boolean isSolvableQ()

needsAnotherIteration

protected abstract boolean needsAnotherIteration()

performIteration

protected abstract void performIteration()

solveFullKKT

protected boolean solveFullKKT(PhysicalStore<Double> preallocated)

solveLP

protected Optimisation.Result solveLP()

The LP result with a Optimisation.State suitable for this solver – most likely Optimisation.State.FEASIBLE. IF the LP was solved to optimality but the Q matrix (or the entire objective function) was disregarded then the returned state will just be Optimisation.State.FEASIBLE.

isPatchedQ

boolean isPatchedQ()

isZeroQ

boolean isZeroQ()

update

void update(Access1D<?> mtrxC,
 Access1D<?> mtrxBE,
 Access1D<?> mtrxBI)

Specifically for use by IterativeRefinementSolver2