Nondifferentiable optimization by smooth approximations
DOI10.1080/02331938608843097zbMath0591.49016OpenAlexW2095559005MaRDI QIDQ3719359
Publication date: 1986
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938608843097
optimal controldualitylocally Lipschitz functionsgeneralized gradientscontinuous programmingsemiinfinite programmingNecessary Lagrangian conditionsnonsmooth constraint minimization problem
Nonlinear programming (90C30) Fréchet and Gateaux differentiability in optimization (49J50) Semi-infinite programming (90C34) Duality theory (optimization) (49N15) Continuity and differentiation questions (26B05) Optimality conditions for free problems in two or more independent variables (49K10)
Related Items (49)
Cites Work
- Unnamed Item
- Unnamed Item
- On sufficiency of the Kuhn-Tucker conditions
- A subgradient duality theorem
- Optimization and nonsmooth analysis
- Nonconvex minimization problems
- Invex functions and constrained local minima
- A generalized Farkas lemma with applications to quasidifferentiable programming
- A New Approach to Lagrange Multipliers
This page was built for publication: Nondifferentiable optimization by smooth approximations