Reaktoro
A unified framework for modeling chemically reactive systems
OptimumSolverIpNewton.hpp
1 // Reaktoro is a unified framework for modeling chemically reactive systems.
2 //
3 // Copyright (C) 2014-2018 Allan Leal
4 //
5 // This library is free software; you can redistribute it and/or
6 // modify it under the terms of the GNU Lesser General Public
7 // License as published by the Free Software Foundation; either
8 // version 2.1 of the License, or (at your option) any later version.
9 //
10 // This library is distributed in the hope that it will be useful,
11 // but WITHOUT ANY WARRANTY; without even the implied warranty of
12 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 // Lesser General Public License for more details.
14 //
15 // You should have received a copy of the GNU Lesser General Public License
16 // along with this library. If not, see <http://www.gnu.org/licenses/>.
17 
18 #pragma once
19 
20 // Reaktoro includes
21 #include <Reaktoro/Optimization/OptimumSolverBase.hpp>
22 
23 namespace Reaktoro {
24 
25 // Forward declarations
26 struct OptimumOptions;
27 struct OptimumProblem;
28 struct OptimumResult;
29 struct OptimumState;
30 
33 {
34 public:
37 
40 
42  virtual ~OptimumSolverIpNewton();
43 
46 
50  virtual auto solve(const OptimumProblem& problem, OptimumState& state) -> OptimumResult;
51 
56  virtual auto solve(const OptimumProblem& problem, OptimumState& state, const OptimumOptions& options) -> OptimumResult;
57 
61  virtual auto dxdp(VectorConstRef dgdp, VectorConstRef dbdp) -> Vector;
62 
64  virtual auto clone() const -> OptimumSolverBase*;
65 
66 private:
67  struct Impl;
68 
69  std::unique_ptr<Impl> pimpl;
70 };
71 
72 } // namespace Reaktoro
The base class for all optimization algorithms.
Definition: OptimumSolverBase.hpp:36
A type that describes the non-linear constrained optimisation problem.
Definition: OptimumProblem.hpp:49
The namespace containing all components of the Reaktoro library.
Definition: ChemicalScalar.hpp:24
virtual auto solve(const OptimumProblem &problem, OptimumState &state) -> OptimumResult
Solve an optimisation problem.
Definition: OptimumSolverIpNewton.cpp:455
A type that describes the options of a optimisation calculation.
Definition: OptimumOptions.hpp:187
A type that describes the state of an optimum solution.
Definition: OptimumState.hpp:29
A type that describes the result of an optimisation calculation.
Definition: OptimumResult.hpp:24
virtual auto clone() const -> OptimumSolverBase *
Return a clone of this instance.
Definition: OptimumSolverIpNewton.cpp:470
OptimumSolverIpNewton()
Construct a default OptimumSolverIpNewton instance.
Definition: OptimumSolverIpNewton.cpp:438
virtual auto dxdp(VectorConstRef dgdp, VectorConstRef dbdp) -> Vector
Return the sensitivity dx/dp of the solution x with respect to a vector of parameters p.
Definition: OptimumSolverIpNewton.cpp:465
auto operator=(OptimumSolverIpNewton other) -> OptimumSolverIpNewton &
Assign an OptimumSolverIpNewton instance to this.
Definition: OptimumSolverIpNewton.cpp:449
Eigen::Ref< const Eigen::VectorXd > VectorConstRef
< Alias to Eigen type Ref<VectorXd>.
Definition: Matrix.hpp:31
The class that implements the IpNewton algorithm using an interior-point method.
Definition: OptimumSolverIpNewton.hpp:33
virtual ~OptimumSolverIpNewton()
Destroy this OptimumSolverIpNewton instance.
Definition: OptimumSolverIpNewton.cpp:446