| AmplAdaptor | Initializes and maintains a connection to a problem specified in Ampl |
| AmplDenseFunctional | An implementation of a AmplFunctional that uses dense matrices |
| AmplFunctional | An implementation of Functional that uses Ampl to compute function values and derivatives |
| AmplSparseFunctional | An implementation of a AmplFunctional that uses dense matrices |
| BasicCategorizeConstraints | A class representing a "function object" that categorizes constraints into lower bounds, upper bounds and equality constraints |
| BoundsFindFixed | A "function object" that finds variables with fixed bounds |
| ConcreteEvaluationContext | A subclass of EvaluationContext to be used with ConcreteFunctionals |
| ConcreteFunctional | A Functional that doesn't need an EvaluationContext to compute function values and derivatives |
| CuterAdaptor | Initializes and maintains a connection to a problem that has been specified in using Cuter |
| CuterDenseFunctional | An implementation of CuterFunctional that uses dense matrices |
| CuterFunctional | An implementation of Functional that uses Cuter to compute function values and derivatives |
| CuterSparseFunctional | An implementation of CuterFunctional that uses sparse matrices |
| DefaultCategorizeGenConstraints | The default rule for categorizing constraints into those that are strictly satisified and those that are not |
| DenseGenMatrix | An implementation of GenMatrix that supports matrix operations for dense matrices with no special structure |
| DensePrimalDualSystem | A subclass of PrimalDualSystem that represents its data as dense matrices |
| DenseSymMatrix | An implementation of SymMatrix that supports matrix operations for dense symmetric matrices |
| DenseSymSolver | A subclass of class LinearSolver dedicated to solving dense symmetric systems |
| ElementGather | Represents a subset of the indices of a vector, and the operation of gathering elements from these indices into another vector |
| ElementGatherSeq | An implementation of ElementGather for a sequential (uni-processor) environment |
| ElementTransfer | Represents the operation of transfering the values of a subset of the elements of one vector into a subset of the locations in another vector |
| ElementTransferSeq | An implementation of ElementTransfer for a sequential (uni-processor) environment |
| EvaluationContext | Represents the partial results of a computation for a specific value of the primal and dual variables, and contains methods for completing the computation of function values and derivatives |
| FilteredMult | Matrix multiplication that omits any columns not included in a specific index set |
| Functional | Represents the objective and constraint functions of a nonlinear problem |
| GenMatrix | A class that supports matrix operations and storage for matrices with no special structure |
| Handle< T > | A class whose instances act like pointers that manage their reference count automatically |
| IndexSetCollector | A class used to collect a set of index numbers in a data structure that may be used to create an ElementGatherSeq |
| IndexSetIterator | A class whose instances may be used to iterate over a set of indices, stored as condensed sequences, either by element or by sequence |
| IotrAmplDriver | A class to support driver for main() files |
| IotrConfigOption | A class used internally by IotrConfiguration to represent an individual option |
| IotrConfigParser | A class whose instances read configuration information from a stream and insert this information into an instance of IotrConfiguration |
| IotrConfiguration | A class whose instances represent a hierarchical set of configuration options |
| IotrCuterDriver | A class to support driver for main() files |
| IotrDriver | A class to support driver for main() files |
| IotrLineSearchSolver | A class whose instances attempt to solve nonlinear programming problems using a line-search variant of the Iotr algorithm |
| IotrMask | A class whose instances represent a set of integer indices |
| IotrMaskSeq | A sequential (single-processor) implementation of IotrMask |
| IotrMatrixDisplayFormat | A struct whose instances specify an ASCII format for displaying the elements of a matrix |
| IotrOption< T > | A struct that may be used as a convenient way to specify options for an instance of IotrConfiguration |
| IotrPrinting | A class used to print major and minor iterations result to standard or file output |
| IotrRefCount | A base class for classes that support reference-count garbage collection, see the Reference Counting section of the manual |
| IotrSolver | Class which attempts to solve a nonlinear problem |
| IotrVector | A class which supports vector operations and storage |
| IotrVectorCategorize | A rule for dividing this vector into categories, possibly based also on the values in one or more additonal vectors |
| IotrVectorDisplayFormat | A struct whose instances specify an ASCII format for displaying the elements of a vector |
| IotrVectorReduce< T > | A superclass for "function objects" that implement a reduction operation |
| LinearOperator | A class whose instances perform a linear transformation (for instance, matrix multiplication.) |
| LinearSolver | A class which computes solutions to linear systems of the form Ax=b |
| LinearSymSolver | Implementations of LinearSolver that operate on symmetric matrices |
| Nlp | A class whose instances represent particular nonlinear programs |
| NlpBounds | A class whose instances represent the upper and lower bounds of a nonlinear program |
| NlpGrads | A class whose instances represent the gradients of the objective and constraint functions of a nonlinear program |
| NlpHessian | A class whose instances represent the Hessian of the Lagrangian of a nonlinear program |
| NlpIotrLineSearch | A class representing operations needed by a line-search only version of the iotr algorithm |
| NlpIotrMerit | Represents the merit function used in the iotr algorithm |
| NlpIotrTrustRegion | Represents the trust-region subproblem solved by the iotr algorithm to generate a trial step |
| NlpIterate | An instance of NlpIterate represents the current iterate of a nonlinear programming solver |
| NlpJacobianMult | A linear operator that performs multiplication by the Jacobian matrix defined by an instance of NlpSlackGrads |
| NlpLinsys | Represents and primal-dual system, and provides methods for solving the system |
| NlpLinsysDiag | Represents the diagonal of a primal-dual system |
| NlpLinsysSol | Represents the solution of a primal-dual system, or the right hand side before the system has been solved |
| NlpLocalModel | Represents the linear model of the nonlinear programming problem at a specific iterate |
| NlpLsPrinting | A class used to print major and minor iterations result to standard or file output |
| NlpResiduals | Represents the residual vectors of a primal-dual interior point algorithm |
| NlpSimple | An implementation of Nlp that does not add slack variables, or transform the problem in any way other than to remove fixed variables |
| NlpSimpleGrads | An implementation of NlpGrads that does not add slack variables, or otherwise alter the values of the gradients of the objective or constraint functions, except by removing elements corresponding to fixed variables |
| NlpSimpleHessian | An implementation of NlpHessian that doesn't use slacks or alter the values in any way other than to remove fixed variables |
| NlpSimpleLinsys | An implementation of NlpLinsys that may be used with a NlpSimple problem formulation |
| NlpSimpleLocalModel | An implementation of NlpLocalModel that doesn't use slacks, or alter the data in any way other than to remove fixed variables |
| NlpSimpleValues | An implementation of NlpValues that does not add slack variables, or otherwise alter the given values of the objective and constraint functions |
| NlpSlack | An implementation of Nlp that transforms the problem into a formulation that uses slack variables |
| NlpSlackGrads | An implementation of NlpGrads that transparently includes the gradients of slack variables amoung the other gradients |
| NlpSlackHessian | An implementation of NlpHessian for a formulation that uses slack variables |
| NlpSlackLinsys | An implementation of NlpLinsys the condenses the system by applying block-eliminations to remove blocks corresponding to slack variables |
| NlpSlackLocalModel | An implementation of NlpLocalModel for a formulation that uses slack variables |
| NlpSlackValues | An implementation of NlpValues that transparently applies slack variables |
| NlpSolver | A class whose instances attempt to solve a nonlinear programming problem |
| NlpTrPrinting | A class used to print major and minor iterations result to standard or file output |
| NlpValues | A class whose instances represent the values of the objective and constraint functions of a nonlinear programming problem |
| PrimalDualSystem | A class for representing the condensed primal-dual system |
| Range | Represents a range of integers |
| SimpleArrayDataT< T > | A class whose primary purpose is to hold an array, keeping track of whether or not to delete this array when an instance of class SimpleArrayDataT goes out of scope |
| SimpleVector | A subclass of the class IotrVector that stores a dense vector and supports vector operations |
| SparseGenMatrix | An implementation of GenMatrix that supports matrix operations for sparse matrices with no special structure |
| SparsePrimalDualSystem | A subclass of PrimalDualSystem that represents its data as sparse matrices |
| SparseSymMatrix | A subclass of the class SymMatrix which stores a Symmetric matrix and supports matrix operations for sparse symmetric matrices |
| SparseSymSolver | A subclass of class LinearSolver dedicated to solving sparse symmetric systems |
| SymMatrix | A class that supports matrix operation and storage for symmetric matrices |
