Pipal  1.2.0
Penalty Interior-Point ALgorithm
Loading...
Searching...
No Matches
Pipal::Input< Real > Struct Template Reference

Input structure holding all the data defining the optimization problem. More...

#include <Types.hxx>

Public Member Functions

 Input ()=default
 Default constructor.
 Input (Input const &)=delete
 Delete copy constructor and assignment operator.
Inputoperator= (Input const &)=delete
 Delete copy constructor and assignment operator.

Public Attributes

std::string name
Indices I1
Indices I2
Indices I3
Indices I4
Indices I5
Indices I6
Indices I7
Indices I8
Indices I9
Vector< Real > x0
Vector< Real > b2
Vector< Real > l3
Vector< Real > u4
Vector< Real > l5
Vector< Real > u5
Vector< Real > b6
Vector< Real > l7
Vector< Real > u8
Vector< Real > l9
Vector< Real > u9
Integer n0
Integer n1
Integer n2
Integer n3
Integer n4
Integer n5
Integer n6
Integer n7
Integer n8
Integer n9
Integer nV
Integer nI
Integer nE
Integer nA
Integer vi

Detailed Description

template<typename Real>
struct Pipal::Input< Real >
Template Parameters
RealThe real number type.

Constructor & Destructor Documentation

◆ Input() [1/2]

template<typename Real>
Pipal::Input< Real >::Input ( )
default

◆ Input() [2/2]

template<typename Real>
Pipal::Input< Real >::Input ( Input< Real > const & )
delete

Member Function Documentation

◆ operator=()

template<typename Real>
Input & Pipal::Input< Real >::operator= ( Input< Real > const & )
delete

Member Data Documentation

◆ b2

template<typename Real>
Vector<Real> Pipal::Input< Real >::b2

Right-hand side of fixed variables.

◆ b6

template<typename Real>
Vector<Real> Pipal::Input< Real >::b6

Right-hand side of equality constraints.

◆ I1

template<typename Real>
Indices Pipal::Input< Real >::I1

Indices of free variables.

◆ I2

template<typename Real>
Indices Pipal::Input< Real >::I2

Indices of fixed variables.

◆ I3

template<typename Real>
Indices Pipal::Input< Real >::I3

Indices of lower bounded variables.

◆ I4

template<typename Real>
Indices Pipal::Input< Real >::I4

Indices of upper bounded variables.

◆ I5

template<typename Real>
Indices Pipal::Input< Real >::I5

Indices of lower and upper bounded variables.

◆ I6

template<typename Real>
Indices Pipal::Input< Real >::I6

Indices of equality constraints.

◆ I7

template<typename Real>
Indices Pipal::Input< Real >::I7

Indices of lower bounded constraints.

◆ I8

template<typename Real>
Indices Pipal::Input< Real >::I8

Indices of upper bounded constraints.

◆ I9

template<typename Real>
Indices Pipal::Input< Real >::I9

Indices of lower and upper bounded constraints.

◆ l3

template<typename Real>
Vector<Real> Pipal::Input< Real >::l3

Right-hand side of lower bounded variables.

◆ l5

template<typename Real>
Vector<Real> Pipal::Input< Real >::l5

Right-hand side of lower half of lower and upper bounded variables.

◆ l7

template<typename Real>
Vector<Real> Pipal::Input< Real >::l7

Right-hand side of lower bounded constraints.

◆ l9

template<typename Real>
Vector<Real> Pipal::Input< Real >::l9

Right-hand side of lower half of lower and upper bounded constraints.

◆ n0

template<typename Real>
Integer Pipal::Input< Real >::n0

Number of original formulation variables.

◆ n1

template<typename Real>
Integer Pipal::Input< Real >::n1

Number of free variables.

◆ n2

template<typename Real>
Integer Pipal::Input< Real >::n2

Number of fixed variables.

◆ n3

template<typename Real>
Integer Pipal::Input< Real >::n3

Number of lower bounded variables.

◆ n4

template<typename Real>
Integer Pipal::Input< Real >::n4

Number of upper bounded variables.

◆ n5

template<typename Real>
Integer Pipal::Input< Real >::n5

Number of lower and upper bounded variables.

◆ n6

template<typename Real>
Integer Pipal::Input< Real >::n6

Number of equality constraints.

◆ n7

template<typename Real>
Integer Pipal::Input< Real >::n7

Number of lower bounded constraints.

◆ n8

template<typename Real>
Integer Pipal::Input< Real >::n8

Number of upper bounded constraints.

◆ n9

template<typename Real>
Integer Pipal::Input< Real >::n9

Number of lower and upper bounded constraints.

◆ nA

template<typename Real>
Integer Pipal::Input< Real >::nA

Size of primal-dual matrix.

◆ name

template<typename Real>
std::string Pipal::Input< Real >::name

Problem identity.

◆ nE

template<typename Real>
Integer Pipal::Input< Real >::nE

Number of equality constraints.

◆ nI

template<typename Real>
Integer Pipal::Input< Real >::nI

Number of inequality constraints.

◆ nV

template<typename Real>
Integer Pipal::Input< Real >::nV

Number of variables.

◆ u4

template<typename Real>
Vector<Real> Pipal::Input< Real >::u4

Right-hand side of upper bounded variables.

◆ u5

template<typename Real>
Vector<Real> Pipal::Input< Real >::u5

Right-hand side of upper half of lower and upper bounded variables.

◆ u8

template<typename Real>
Vector<Real> Pipal::Input< Real >::u8

Right-hand side of upper bounded constraints.

◆ u9

template<typename Real>
Vector<Real> Pipal::Input< Real >::u9

Right-hand side of upper half of lower and upper bounded constraints.

◆ vi

template<typename Real>
Integer Pipal::Input< Real >::vi

Counter for invalid bounds.

◆ x0

template<typename Real>
Vector<Real> Pipal::Input< Real >::x0

Initial guess for the primal variables.


The documentation for this struct was generated from the following file: