Characterizations of strict local minima for some nonlinear programming problems

DOI10.1016/S0362-546X(97)00352-0zbMath0914.90243MaRDI QIDQ4378794

Marcin Studniarski

Publication date: 5 March 1998

Published in: Nonlinear Analysis: Theory, Methods & Applications (Search for Journal in Brave)

zbMATH Keywords

nondifferentiable optimizationcontingent coneKuhn-Tucker conditionsstrict local minimizer

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (9)

Necessary conditions for efficiency in terms of the Michel–Penot subdifferentials ⋮ The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming ⋮ Characterization of vector strict global minimizers of order 2 in differentiable vector optimization problems under a new approximation method ⋮ Higher-order optimality conditions for strict local minima ⋮ Variational analysis on local sharp minima via exact penalization ⋮ Weak sharp efficiency and growth condition for vector-valued functions with applications ⋮ A characterization of strict local minimizers of order one for nonsmooth static minmax problems ⋮ Regularity Conditions and Optimality in Vector Optimization ⋮ A Characterization of Strict Local Minimizers of Order One for Static Minmax Problems in the Parametric Constraint Case

Cites Work

• Unnamed Item
• Stability and regular points of inequality systems
• Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
• Characterizations of strict local minima and necessary conditions for weak sharp minima
• Contingent cone to a set defined by equality and inequality constraints at a Fréchet differentiable point
• Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions

This page was built for publication: Characterizations of strict local minima for some nonlinear programming problems