Go to the documentation of this file.
9 #ifndef __IPIPOPTALG_HPP__
10 #define __IPIPOPTALG_HPP__
71 const std::string& prefix);
206 Index& n_only_upper);
216 const Vector& trial_slack,
217 const Vector& trial_compl,
IpoptAlgorithm()
Default Constructor.
Number correct_bound_multiplier(const Vector &trial_z, const Vector &trial_slack, const Vector &trial_compl, SmartPtr< const Vector > &new_trial_z)
Method for ensuring that the trial multipliers are not too far from the primal estime.
void operator=(const IpoptAlgorithm &)
Overloaded Equals Operator.
SmartPtr< SearchDirectionCalculator > SearchDirCalc()
void PrintProblemStatistics()
Print the problem size statistics.
virtual bool InitializeImpl(const OptionsList &options, const std::string &prefix)
overloaded from AlgorithmStrategyObject
Number Number * x_U
Upper bounds on variables.
Number * x_L
Lower bounds on variables.
bool ComputeSearchDirection()
Method to setup the call to the PDSystemSolver.
double Number
Type of all numbers.
void ComputeAcceptableTrialPoint()
Method computing the new iterate (usually vialine search).
SmartPtr< IterateInitializer > iterate_initializer_
SmartPtr< MuUpdate > mu_update_
SolverReturn Optimize(bool isResto=false)
Main solve method.
Number * x
Input: Starting point Output: Optimal solution.
Number recalc_y_feas_tol_
Feasibility threshold for recalc_y.
void InitializeIterates()
Sets up initial values for the iterates, Corrects the initial values for x and s (force in bounds)
void UpdateHessian()
Method for updating the current Hessian.
int Index
Type of all indices of vectors, matrices etc.
bool mehrotra_algorithm_
Flag indicating if we want to do Mehrotras's algorithm.
static void RegisterOptions(SmartPtr< RegisteredOptions > roptions)
Methods for IpoptType.
SmartPtr< EqMultiplierCalculator > eq_multiplier_calculator_
The multipler calculator (for y_c and y_d) has to be set only if option recalc_y is set to true.
Template class for Smart Pointers.
SmartPtr< IterationOutput > iter_output_
SmartPtr< ConvergenceCheck > conv_check_
SmartPtr< LineSearch > line_search_
void OutputIteration()
Do all the output for one iteration.
void calc_number_of_bounds(const Vector &x, const Vector &x_L, const Vector &x_U, const Matrix &Px_L, const Matrix &Px_U, Index &n_tot, Index &n_only_lower, Index &n_both, Index &n_only_upper)
Number kappa_sigma_
safeguard factor for bound multipliers.
SmartPtr< HessianUpdater > hessian_updater_
IpoptAlgorithm(const IpoptAlgorithm &)
Copy Constructor.
virtual ~IpoptAlgorithm()
Default destructor.
IpoptAlgorithm(const SmartPtr< SearchDirectionCalculator > &search_dir_calculator, const SmartPtr< LineSearch > &line_search, const SmartPtr< MuUpdate > &mu_update, const SmartPtr< ConvergenceCheck > &conv_check, const SmartPtr< IterateInitializer > &iterate_initializer, const SmartPtr< IterationOutput > &iter_output, const SmartPtr< HessianUpdater > &hessian_updater, const SmartPtr< EqMultiplierCalculator > &eq_multiplier_calculator=NULL)
Constructor.
Class responsible for all message output.
This is the base class for all algorithm strategy objects.
bool skip_print_problem_stats_
Flag indicating if the statistic should not be printed.
The main ipopt algorithm class.
bool recalc_y_
Flag indicating whether the y multipliers should be recalculated with the eq_mutliplier_calculator ob...
void ComputeFeasibilityMultipliers()
Compute the Lagrangian multipliers for a feasibility problem.
static void print_copyright_message(const Journalist &jnlst)
SolverReturn
enum for the return from the optimize algorithm (obviously we need to add more)
void AcceptTrialPoint()
Method for accepting the trial point as the new iteration, possibly after adjusting the variable boun...
bool UpdateBarrierParameter()
Method to update the barrier parameter.
std::string linear_solver_
String specifying linear solver.
This class stores a list of user set options.
DECLARE_STD_EXCEPTION(SUFFIX_EMPTY)
SmartPtr< SearchDirectionCalculator > search_dir_calculator_