Abstract cone approximations and generalized differentiability in nonsmooth optimization
Publication:3802130
DOI10.1080/02331938808843348zbMath0655.49009OpenAlexW2060888701MaRDI QIDQ3802130
K. H. Elster, Jörg Thierfelder
Publication date: 1988
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938808843348
directional differentiabilitynecessary conditions of Kuhn-Tucker typelocally convex Hausdorff topological vector spacegeneralized subgradient setlocal cone approximation
Nonlinear programming (90C30) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48) General theory of locally convex spaces (46A03) Derivatives of functions in infinite-dimensional spaces (46G05) Optimality conditions for problems in abstract spaces (49K27)
Related Items (20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tangency and differentiation: Some applications of convergence theory
- Calcul sous-différentiel et optimisation
- Sulla differenziabilita totale delle funzioni di piu variabili reali
- Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
- Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
- Optimization and nonsmooth analysis
- Geometry of optimality conditions and constraint qualifications: The convex case
- Generalized Directional Derivatives and Subgradients of Nonconvex Functions
- Approximation operators in optimization theory
- Tangent Sets’ Calculus and Necessary Conditions for Extremality
- On regularity conditions in mathematical programming
- On optimality conditions in nondifferentiable programming
- Differentiability in optimization theory1
- A New Approach to Lagrange Multipliers
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Directionally Lipschitzian Functions and Subdifferential Calculus
- Nonlinear Programming in Banach Space
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Convex Analysis
- A Necessary and Sufficient Qualification for Constrained Optimization
This page was built for publication: Abstract cone approximations and generalized differentiability in nonsmooth optimization