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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper discusses a kind of nonlinear inequality constrained optimization problems without any constraint qualification. A new sequential quadratic programming algorithm for such problems is proposed, whose important features are as follows: (i) a new relaxation technique for the linearized constraints of the quadratic programming subproblem is introduced, which guarantees that the subproblem is always consistent and generates a favourable search direction; (ii) a weaker positive-definiteness assumption on the quadratic coefficient matrices is presented; (iii) a slightly new line search is adopted, where neither a penalty function nor a filter is used; (iv) an associated acceptable termination rule is introduced; (v) the finite convergence of the algorithm is proved. Furthermore, the numerical results on a collection of CUTE test problems show that the proposed algorithm is promising.

optimization

A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization