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/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

A standard quadratic optimization problem (StQP) is to find optimal values of a quadratic form over the standard simplex. The concept of possibility distribution was proposed by L. A. Zadeh. This paper applies the concept of possibility distribution function to solving StQP. The application of possibility distribution function establishes that it encapsulates the constrained conditions of the standard simplex into the possibility distribution function, and the derivative of the StQP formula becomes a linear function. As a result, the computational complexity of StQP problems is reduced, and the solutions of the proposed algorithm are always over the standard simplex. This paper proves that NP-hard StQP problems are in P. Numerical examples demonstrate that StQP problems can be solved by solving a set of linear equations. Comparing with Lagrangian function method, the solutions of the new algorithm are reliable when the symmetric matrix is indefinite.

The Application of Possibility Distribution for Solving Standard Quadratic Optimization Problems