com.numericalmethod.suanshu.optimization.constrained.convex.sdp.socp.interiorpoint

Class PrimalDualSolution

java.lang.Object

com.numericalmethod.suanshu.optimization.constrained.convex.sdp.socp.interiorpoint.PrimalDualSolution

All Implemented Interfaces:

java.io.Serializable

public class PrimalDualSolution
extends java.lang.Object
implements java.io.Serializable

The vector set {x, s, y} is a solution to both the primal and dual SOCP problems.

See Also:

Serialized Form

Field Summary

Fields

Modifier and Type	Field and Description
ImmutableVector	s This is the auxiliary helper to solve the dual problem.
ImmutableVector	x This is the minimizer for the primal problem.
ImmutableVector	y This is the maximizer for the dual problem.

Constructor Summary

Constructors

Constructor and Description
PrimalDualSolution(Vector x, Vector s, Vector y) Construct a solution to a primal and a dual SOCP problems.

Method Summary

Methods inherited from class java.lang.Object

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

Field Detail

x

public final ImmutableVector x

This is the minimizer for the primal problem.

y

public final ImmutableVector y

This is the maximizer for the dual problem.

s

public final ImmutableVector s

This is the auxiliary helper to solve the dual problem.

Constructor Detail

PrimalDualSolution

public PrimalDualSolution(Vector x,
                          Vector s,
                          Vector y)

Construct a solution to a primal and a dual SOCP problems.

Parameters:

x - the minimizer for the primal problem

s - the auxiliary helper to solve the dual problem

y - the maximizer for the dual problem