English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

In this paper we present an algorithm for solving a DC problem non convex on an interval [a, b] of R. We use the DCA (Difference of Convex Algorithm) and the minimum of the average of two approximations of the function from a and b. This strategy has the advantage of giving in general a minimum to be situated in the attraction zone of the global minimum searched. After applying the DCA from this minimum we certainly arrive at the global minimum searched.

applied mathematical sciences

Improving the robustness of difference of convex algorithm in the research of a global optimum of a non convex differentiable function defined on a bounded closed interval