# This code is part of Qiskit.
#
# (C) Copyright IBM 2018, 2020.
#
# obtain a copy of this license in the LICENSE.txt file in the root directory
#
# Any modifications or derivative works of this code must retain this
# copyright notice, and modified files need to carry a notice indicating
# that they have been altered from the originals.

from typing import Optional
import logging

from scipy.optimize import minimize
from .optimizer import Optimizer, OptimizerSupportLevel

logger = logging.getLogger(__name__)

"""

The Nelder-Mead algorithm performs unconstrained optimization; it ignores bounds
or constraints.  It is used to find the minimum or maximum of an objective function
in a multidimensional space.  It is based on the Simplex algorithm. Nelder-Mead
is robust in many applications, especially when the first and second derivatives of the
objective function are not known.

However, if the numerical computation of the derivatives can be trusted to be accurate,
other algorithms using the first and/or second derivatives information might be preferred to
Nelder-Mead for their better performance in the general case, especially in consideration of
the fact that the Nelder–Mead technique is a heuristic search method that can converge to
non-stationary points.

For further detail, please refer to
See https://docs.scipy.org/doc/scipy/reference/generated/scipy.optimize.minimize.html
"""

_OPTIONS = ['maxiter', 'maxfev', 'disp', 'xatol', 'adaptive']

# pylint: disable=unused-argument
[ドキュメント]    def __init__(self,
maxiter: Optional[int] = None,
maxfev: int = 1000,
disp: bool = False,
xatol: float = 0.0001,
tol: Optional[float] = None,
adaptive: bool = False) -> None:
"""
Args:
maxiter: Maximum allowed number of iterations. If both maxiter and maxfev are set,
minimization will stop at the first reached.
maxfev: Maximum allowed number of function evaluations. If both maxiter and
maxfev are set, minimization will stop at the first reached.
disp: Set to True to print convergence messages.
xatol: Absolute error in xopt between iterations that is acceptable for convergence.
tol: Tolerance for termination.
"""
super().__init__()
for k, v in list(locals().items()):
if k in self._OPTIONS:
self._options[k] = v
self._tol = tol

[ドキュメント]    def get_support_level(self):
""" Return support level dictionary """
return {