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

In [M. Fukushima and P. Tseng, SIAM J. Optim., 12 (2002),pp. 724-739], an ∈-active set algorithm was proposed forsolving a mathematical program with a smooth objective function andlinear inequality/complementarity constraints. It is assertedtherein that, under a uniform LICQ on the ∈-feasible set, thisalgorithm generates iterates whose cluster points are B-stationarypoints of the problem. However, the proof has a gap and shows onlythat each cluster point is an M-stationary point. We discuss thisgap and show that B-stationarity can be achieved if the algorithmis modified and an additional error bound condition holds.

An Implementable Active‐Set Algorithm for Computing a B‐Stationary Point of a Mathematical Program with Linear Complementarity Constraints: Erratum