Mathematical Methods of Operations Research Исследование операций и наука управления

Revisiting approximate minimality and approximate criticality in scalar optimization with constraints

Marius Durea, Elena-Andreea Florea, Radu Strugariu
Springer Nature · 2026-02-28 · DOI 10.1007/s00186-026-00915-9

Аннотация

Abstract This paper examines various questions related to approximate minimality and approximate criticality in constrained scalar optimization. We establish necessary optimality conditions for the approximate minimality of a lower semicontinuous (and therefore non-Lipschitz) function under a set constraint. Additionally, we explore the relationship between approximate criticality and genuine minimality of perturbed functions. A key tool in deriving these results is the use of well-known penalization functions.

Читать у издателя →