pub struct OptimizationProblem {
pub ansatz: ParametricCircuit,
pub objective_function: Box<dyn ObjectiveFunction>,
pub bounds: Option<Vec<(f64, f64)>>,
pub constraints: Vec<OptimizationConstraint>,
}Expand description
Optimization problem definition
Fields§
§ansatz: ParametricCircuit§objective_function: Box<dyn ObjectiveFunction>§bounds: Option<Vec<(f64, f64)>>§constraints: Vec<OptimizationConstraint>Implementations§
Source§impl OptimizationProblem
impl OptimizationProblem
Sourcepub fn new(
ansatz: ParametricCircuit,
objective_function: Box<dyn ObjectiveFunction>,
) -> Self
pub fn new( ansatz: ParametricCircuit, objective_function: Box<dyn ObjectiveFunction>, ) -> Self
Create new optimization problem
Sourcepub fn with_bounds(self, bounds: Vec<(f64, f64)>) -> Self
pub fn with_bounds(self, bounds: Vec<(f64, f64)>) -> Self
Add parameter bounds
Sourcepub fn with_constraint(self, constraint: OptimizationConstraint) -> Self
pub fn with_constraint(self, constraint: OptimizationConstraint) -> Self
Add optimization constraint
Sourcepub fn evaluate_objective(&self, parameters: &Array1<f64>) -> DeviceResult<f64>
pub fn evaluate_objective(&self, parameters: &Array1<f64>) -> DeviceResult<f64>
Evaluate objective function at given parameters
Sourcepub fn compute_gradient(
&self,
parameters: &Array1<f64>,
) -> DeviceResult<Array1<f64>>
pub fn compute_gradient( &self, parameters: &Array1<f64>, ) -> DeviceResult<Array1<f64>>
Compute gradient using parameter shift rule
Sourcepub fn check_constraints(&self, parameters: &Array1<f64>) -> bool
pub fn check_constraints(&self, parameters: &Array1<f64>) -> bool
Check if parameters satisfy constraints
Auto Trait Implementations§
impl Freeze for OptimizationProblem
impl !RefUnwindSafe for OptimizationProblem
impl Send for OptimizationProblem
impl Sync for OptimizationProblem
impl Unpin for OptimizationProblem
impl !UnwindSafe for OptimizationProblem
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.