First-order and second-order optimality conditions for nonsmooth constrained problems via convolution smoothing
DOI10.1080/02331934.2010.522713zbMath1216.49019OpenAlexW1981696866MaRDI QIDQ2996801
Boris S. Mordukhovich, Andrew S. Eberhard
Publication date: 3 May 2011
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://digitalcommons.wayne.edu/cgi/viewcontent.cgi?article=1073&context=math_reports
constrained optimizationfirst-order optimality conditionvariational analysisgeneralized differentiationsecond order optimality condition
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Methods involving semicontinuity and convergence; relaxation (49J45) Nondifferentiability (nondifferentiable functions, points of nondifferentiability), discontinuous derivatives (26A27) Optimality conditions for free problems in two or more independent variables (49K10)
Related Items
Cites Work
- A bundle-filter method for nonsmooth convex constrained optimization
- Characterizations of strict local minima and necessary conditions for weak sharp minima
- Convergence of some algorithms for convex minimization
- Necessary conditions in nonsmooth minimization via lower and upper subgradients
- A comparison of second-order epiderivatives: Calculus and optimality conditions
- On Second-Order Subdifferentials and Their Applications
- Stability in Mathematical Programming with Nondifferentiable Data
- Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions
- User’s guide to viscosity solutions of second order partial differential equations
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- Prox-regular functions in variational analysis
- Some Sufficient Optimality Conditions in Nonsmooth Analysis