32  EIGEN_MAKE_ALIGNED_OPERATOR_NEW
 
   39  SolverIpopt(std::shared_ptr<crocoddyl::ShootingProblem> problem);
 
   42  bool solve(
const std::vector<Eigen::VectorXd>& init_xs = DEFAULT_VECTOR,
 
   43             const std::vector<Eigen::VectorXd>& init_us = DEFAULT_VECTOR,
 
   44             const std::size_t maxiter = 100, 
const bool is_feasible = 
false,
 
   45             const double reg_init = 1e-9);
 
   64  void set_th_stop(
const double th_stop);
 
   67  Ipopt::SmartPtr<IpoptInterface> ipopt_iface_;
 
   68  Ipopt::SmartPtr<Ipopt::IpoptApplication> ipopt_app_;
 
   69  Ipopt::ApplicationReturnStatus ipopt_status_;
 
   71  virtual void computeDirection(
const bool recalc);
 
   72  virtual double tryStep(
const double steplength = 1);
 
   73  virtual double stoppingCriteria();
 
   74  virtual const Eigen::Vector2d& expectedImprovement();
 
 
bool solve(const std::vector< Eigen::VectorXd > &init_xs=DEFAULT_VECTOR, const std::vector< Eigen::VectorXd > &init_us=DEFAULT_VECTOR, const std::size_t maxiter=100, const bool is_feasible=false, const double reg_init=1e-9)
Compute the optimal trajectory  as lists of  and  terms.