ConstrainedOptPack::QPSchur Member List

This is the complete list of members for ConstrainedOptPack::QPSchur, including all inherited members.

act_set() const ConstrainedOptPack::QPSchur
DEGENERATE_MULTConstrainedOptPack::QPSchur [static]
dual_infeas_tol(const value_type &dual_infeas_tol)ConstrainedOptPack::QPSchur [inline]
dump_act_set_quantities(const ActiveSet &act_set, std::ostream &out, bool print_S_hat=true)ConstrainedOptPack::QPSchur [static]
EIterRefineReturn enum nameConstrainedOptPack::QPSchur [protected]
EOutputLevel enum nameConstrainedOptPack::QPSchur
EPDSteps enum nameConstrainedOptPack::QPSchur [protected]
error_tol(const value_type &error_tol)ConstrainedOptPack::QPSchur [inline]
ERunTests enum nameConstrainedOptPack::QPSchur
ESolveReturn enum nameConstrainedOptPack::QPSchur
feas_tol(const value_type &feas_tol)ConstrainedOptPack::QPSchur [inline]
huge_dual_step(const value_type &huge_dual_step)ConstrainedOptPack::QPSchur [inline]
huge_primal_step(const value_type &huge_primal_step)ConstrainedOptPack::QPSchur [inline]
iter_refine(const ActiveSet &act_set, std::ostream *out, EOutputLevel output_level, const value_type ao, const DVectorSlice *bo, const value_type aa, const DVectorSlice *ba, DVectorSlice *v, DVectorSlice *z, size_type *iter_refine_num_resid, size_type *iter_refine_num_solves)ConstrainedOptPack::QPSchur [protected]
iter_refine_at_solution(const bool &iter_refine_at_solution)ConstrainedOptPack::QPSchur [inline]
iter_refine_feas_tol(const value_type &iter_refine_feas_tol)ConstrainedOptPack::QPSchur [inline]
iter_refine_max_iter(const size_type &iter_refine_max_iter)ConstrainedOptPack::QPSchur [inline]
iter_refine_min_iter(const size_type &iter_refine_min_iter)ConstrainedOptPack::QPSchur [inline]
iter_refine_opt_tol(const value_type &iter_refine_opt_tol)ConstrainedOptPack::QPSchur [inline]
loose_feas_tol(const value_type &loose_feas_tol)ConstrainedOptPack::QPSchur [inline]
max_iter(const size_type &max_iter)ConstrainedOptPack::QPSchur [inline]
max_real_runtime(const value_type &max_real_runtime)ConstrainedOptPack::QPSchur [inline]
MSADU typedefConstrainedOptPack::QPSchur
pivot_tols(MSADU::PivotTolerances pivot_tols)ConstrainedOptPack::QPSchur
pivot_tols() const ConstrainedOptPack::QPSchur
QP typedefConstrainedOptPack::QPSchur
qp_algo(EPDSteps first_step, std::ostream *out, EOutputLevel output_level, ERunTests test_what, const DVectorSlice &vo, ActiveSet *act_set, DVectorSlice *v, DVectorSlice *x, size_type *iter, size_type *num_adds, size_type *num_drops, size_type *iter_refine_num_resid, size_type *iter_refine_num_solves, StopWatchPack::stopwatch *timer)ConstrainedOptPack::QPSchur [protected, virtual]
QPSchur(const schur_comp_ptr_t &schur_comp=Teuchos::null, size_type max_iter=100, value_type max_real_runtime=1e+20, value_type feas_tol=1e-8, value_type loose_feas_tol=1e-6, value_type dual_infeas_tol=1e-12, value_type huge_primal_step=1e+20, value_type huge_dual_step=1e+20, value_type warning_tol=1e-10, value_type error_tol=1e-5, size_type iter_refine_min_iter=1, size_type iter_refine_max_iter=3, value_type iter_refine_opt_tol=1e-12, value_type iter_refine_feas_tol=1e-12, bool iter_refine_at_solution=true, bool salvage_init_schur_comp=true, MSADU::PivotTolerances pivot_tols=MSADU::PivotTolerances(1e-8, 1e-11, 1e-11))ConstrainedOptPack::QPSchur
salvage_init_schur_comp(const bool &salvage_init_schur_comp)ConstrainedOptPack::QPSchur [inline]
set_multipliers(const ActiveSet &act_set, const DVectorSlice &v, SpVector *mu, DVectorSlice *lambda, SpVector *lambda_breve)ConstrainedOptPack::QPSchur [protected, virtual]
set_schur_comp(const Teuchos::RefCountPtr< MatrixSymAddDelUpdateableWithOpNonsingular > &schur_comp)ConstrainedOptPack::QPSchur [inline]
set_x(const ActiveSet &act_set, const DVectorSlice &v, DVectorSlice *x)ConstrainedOptPack::QPSchur [protected, virtual]
solve_qp(QP &qp, size_type num_act_change, const int ij_act_change[], const EBounds bnds[], std::ostream *out, EOutputLevel output_level, ERunTests test_what, DVectorSlice *x, SpVector *mu, DVectorSlice *lambda, SpVector *lambda_breve, size_type *iter, size_type *num_adds, size_type *num_drops)ConstrainedOptPack::QPSchur [virtual]
timeout_return(StopWatchPack::stopwatch *timer, std::ostream *out, EOutputLevel output_level) const ConstrainedOptPack::QPSchur [protected]
warning_tol(const value_type &warning_tol)ConstrainedOptPack::QPSchur [inline]
~QPSchur()ConstrainedOptPack::QPSchur [inline, virtual]


Generated on Thu Sep 18 12:34:17 2008 for ConstrainedOptPack: C++ Tools for Constrained (and Unconstrained) Optimization by doxygen 1.3.9.1