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

This paper studies the nonhomogeneous quadratic programming problem over a second-order cone with linear equality constraints. When the feasible region is bounded, we show that an optimal solution of the problem can be found in polynomial time. When the feasible region is unbounded, a semidefinite programming (SDP) reformulation is constructed to find the optimal objective value of the original problem in polynomial time. In addition, we provide two sufficient conditions, under which, if the optimal objective value is finite, we show the optimal solution of SDP reformulation can be decomposed into the original space to generate an optimal solution of the original problem in polynomial time. Otherwise, a recession direction can be identified in polynomial time. Numerical examples are included to illustrate the effectiveness of the proposed approach.

Quadratic Optimization over a Second-Order Cone with Linear Equality Constraints