Second-Order Subdifferential Optimality Conditions in Nonsmooth Optimization
Pham Duy Khanh, Vu Vinh Huy Khoa, Boris S. Mordukhovich, Vo Thanh Phat
TL;DR
The paper advances nonsmooth optimization by deriving new second-order necessary and sufficient optimality conditions expressed through second-order subdifferentials for prox-regular extended-real-valued functions in finite dimensions. It leverages Moreau envelopes to connect local minimizers to smooth surrogate problems, develops a coderivative-based theory of variational (strong) convexity, and establishes neighborhood sufficiency results. The results extend to constrained problems, providing explicit second-order criteria in terms of the problem data under mild constraint qualifications such as MSCQ, and yield novel conditions for NLP, including cases where classical LICQ fails. This framework has potential to improve both theoretical understanding and the design of second-order numerical methods for nonsmooth and constrained optimization, including tilt-stable and strongly minimal solutions.
Abstract
The paper is devoted to deriving novel second-order necessary and sufficient optimality conditions for local minimizers in rather general classes of nonsmooth unconstrained and constrained optimization problems in finite-dimensional spaces. The established conditions are expressed in terms of second-order subdifferentials of lower semicontinuous functions and mainly concern prox-regular objectives that cover a large territory in nonsmooth optimization and its applications. Our tools are based on the machinery of variational analysis and second-order generalized differentiation. The obtained general results are applied to problems of nonlinear programming, where the derived second-order optimality conditions are new even for problems with twice continuously differential data, being expressed there in terms of the classical Hessian matrices.
