Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present a brief survey of some of the basic results related to the classical continuous moment problems (CMP) and the recently developed discrete moment problems (DMP), clarifying their relationship and propose new methods for the solution of univariate continuous and discrete por moment problems. In the classical as ll as in the recently developed discrete moment problems the coefficient function in the objective is supposed to be higher order convex (in the entire interval or part of it), or constant in an interval while zero elsewhere, or equal to a constant at some point and zero elsewhere. The concept of a regenerative block (of points) is introduced, for the case of the DMP, that makes it possible to create lor and upper bounds for other functions in the objective. The CMP are solved by discretization and sequential application of dual type algorithm. Numerical results are presented with moments of order up to 40 and various applications are mentioned. Copyright Springer Science+Business Media New York 2016
['András Prékopa', 'Anh Ninh', 'Gabriela Alexe']
I am writing a research paper on a idea On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
[{"from": "human", "value": "I am writing a research paper on a idea On the relationship between the discrete and continuous bounding moment problems and their numerical solutions"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present a brief survey of some of the basic results related to the classical continuous moment problems (CMP) and the recently developed discrete moment problems (DMP), clarifying their relationship and propose new methods for the solution of univariate continuous and discrete por moment problems. In the classical as ll as in the recently developed discrete moment problems the coefficient function in the objective is supposed to be higher order convex (in the entire interval or part of it), or constant in an interval while zero elsewhere, or equal to a constant at some point and zero elsewhere. The concept of a regenerative block (of points) is introduced, for the case of the DMP, that makes it possible to create lor and upper bounds for other functions in the objective. The CMP are solved by discretization and sequential application of dual type algorithm. Numerical results are presented with moments of order up to 40 and various applications are mentioned. Copyright Springer Science+Business Media New York 2016"}]