Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  apply a derivative-free optimization method based on novel low-rank tensor methods to the problem of propagating fuzzy uncertainty through a continuous real-valued function. Adhering to Zadeh's extension principle, such a problem can be reformulated as a sequence of optimization problems over nested search spaces. The optimization method  use is based on a low-rank tensor approximation of the function sampled on a grid and a search for the minimal and maximal entries in this low-rank tensor. In contrast to classical fuzzy uncertainty propagation methods, such as the vertex method and the transformation method, the method  propose does not exhibit an inherent exponential scaling for increasing dimension of the search space. Obviously, no derivative-free optimization algorithm can exist which shows sub-exponential scaling with the dimension for all possible continuous functions. The algorithm that  present here, hover, can exploit a specific type of structure and regularity (beyond continuity) that is often present in real-world optimization problems.  illustrate this with some high-dimensional numerical examples where the presented method clearly outperforms some established derivative-free optimization codes.
['Samuel Corveleyn', 'Stefan Vandewalle']
I am writing a research paper on a idea Computation of the output of a function with fuzzy inputs based on a low-rank tensor approximation
[{"from": "human", "value": "I am writing a research paper on a idea Computation of the output of a function with fuzzy inputs based on a low-rank tensor approximation"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  apply a derivative-free optimization method based on novel low-rank tensor methods to the problem of propagating fuzzy uncertainty through a continuous real-valued function. Adhering to Zadeh's extension principle, such a problem can be reformulated as a sequence of optimization problems over nested search spaces. The optimization method  use is based on a low-rank tensor approximation of the function sampled on a grid and a search for the minimal and maximal entries in this low-rank tensor. In contrast to classical fuzzy uncertainty propagation methods, such as the vertex method and the transformation method, the method  propose does not exhibit an inherent exponential scaling for increasing dimension of the search space. Obviously, no derivative-free optimization algorithm can exist which shows sub-exponential scaling with the dimension for all possible continuous functions. The algorithm that  present here, hover, can exploit a specific type of structure and regularity (beyond continuity) that is often present in real-world optimization problems.  illustrate this with some high-dimensional numerical examples where the presented method clearly outperforms some established derivative-free optimization codes."}]