ConstrainedOptPack: C++ Tools for Constrained (and Unconstrained) Optimization  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
Public Member Functions | Protected Member Functions | List of all members
ConstrainedOptPack::QPSolverRelaxedQPSchurSetOptions Class Reference

Set options for QPSolverRelaxedQPSchur from an OptionsFromStream object. More...

#include <ConstrainedOptPack_QPSolverRelaxedQPSchurSetOptions.hpp>

Inheritance diagram for ConstrainedOptPack::QPSolverRelaxedQPSchurSetOptions:
Inheritance graph
[legend]

Public Member Functions

 QPSolverRelaxedQPSchurSetOptions (QPSolverRelaxedQPSchur *target=0, const char opt_grp_name[]="QPSolverRelaxedQPSchur")
 

Protected Member Functions

void setOption (int option_num, const std::string &option_value)
 Overridden from SetOptionsFromStreamNode. More...
 

Detailed Description

Set options for QPSolverRelaxedQPSchur from an OptionsFromStream object.

The default options group name is QPSolverRelaxedQPSchur.

The options group is:

{verbatim} options_group QPSolverRelaxedQPSchur { max_qp_iter_frac = 10.0; *** (+dbl) max_qp_itr = max_qp_itr_frac * (# variables) max_real_runtime = 1e+20; *** (+dbl) maximum runtime in minutes inequality_pick_policy = ADD_BOUNDS_THEN_MOST_VIOLATED_INEQUALITY; inequality_pick_policy = ADD_BOUNDS_THEN_FIRST_VIOLATED_INEQUALITY; *** not supported yet! inequality_pick_policy = ADD_MOST_VIOLATED_BOUNDS_AND_INEQUALITY; bounds_tol = 1e-10; *** (+dbl) feasibility tolerance for bound constriants inequality_tol = 1e-10; *** (+dbl) feasibility tolerance for general inequality constriants equality_tol = 1e-10; *** (+dbl) feasibility tolerance for general equality constriants loose_feas_tol = 1e-9; *** (+dbl) (Expert use only) dual_infeas_tol = 1e-12; *** (+dbl) allowable dual infeasiblity before error huge_primal_step = 1e+20; *** (+dbl) value of a near infinite primal step huge_dual_step = 1e+20; *** (+dbl) value of a near infinite dual step bigM = 1e+10; *** (+dbl) value or relaxation penalty in objective warning_tol = 1e-10; *** Testing warning tolerance error_tol = 1e-5; *** Testing error tolerance iter_refine_min_iter = 1; *** (+int) Minimum number of iterative refinement iterations iter_refine_max_iter = 3; *** (+int) Maximum number of iterative refinement iterations iter_refine_opt_tol = 1e-12; *** (+dbl) Optimality tolarance for iterative refinement iter_refine_feas_tol = 1e-12; *** (+dbl) Feasibility tolerance for iterative refinement iter_refine_at_solution = true; *** (+dbl) If true then iterative refinement will always be used pivot_warning_tol = 1e-6; *** (+dbl) Relative warning tolerance for a pivot element in the schur complement pivot_singular_tol = 1e-8; *** (+dbl) Relative singularity tolerance for a pivot element in the schur complement pivot_wrong_iniertia_tol = 1e-10; *** (+dbl) Relative tolerance for a pivot element in the schur complement for wrong inertia print_level = USE_INPUT_ARG; *** Use the input argument to solve_qp(...) print_level = NO_OUTPUT; print_level = OUTPUT_BASIC_INFO; print_level = OUTPUT_ITER_SUMMARY; print_level = OUTPUT_ITER_STEPS; print_level = OUTPUT_ACT_SET; print_level = OUTPUT_ITER_QUANTITIES; } {verbatim}

Definition at line 93 of file ConstrainedOptPack_QPSolverRelaxedQPSchurSetOptions.hpp.

Constructor & Destructor Documentation

ConstrainedOptPack::QPSolverRelaxedQPSchurSetOptions::QPSolverRelaxedQPSchurSetOptions ( QPSolverRelaxedQPSchur target = 0,
const char  opt_grp_name[] = "QPSolverRelaxedQPSchur" 
)

Member Function Documentation

void ConstrainedOptPack::QPSolverRelaxedQPSchurSetOptions::setOption ( int  option_num,
const std::string &  option_value 
)
protectedvirtual

Overridden from SetOptionsFromStreamNode.

Implements OptionsFromStreamPack::SetOptionsFromStreamNode.

Definition at line 116 of file ConstrainedOptPack_QPSolverRelaxedQPSchurSetOptions.cpp.


The documentation for this class was generated from the following files: