Subdifferentials of compactly Lipschitzian vector-valued functions
From MaRDI portal
Publication:1164829
DOI10.1007/BF01789411zbMath0486.46037OpenAlexW2001492912MaRDI QIDQ1164829
Publication date: 1980
Published in: Annali di Matematica Pura ed Applicata. Serie Quarta (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01789411
Related Items (47)
V-subdifferentials of convex operators ⋮ Homeomorphisms and generalized derivatives ⋮ Subdifferential of a sum ⋮ \(\varepsilon k^ 0\)-subdifferentials of convex functions ⋮ The Lipschitzianity of convex vector and set-valued functions ⋮ Parametrizations of Kojima's system and relations to penalty and barrier functions ⋮ Tangent Cones and Quasi-Interiorly Tangent Cones to Multifunctions ⋮ Nonsmooth analysis of vector-valued mappings with contributions to nondifferentiable programming ⋮ Lipschitzian stability of constraint systems and generalized equations ⋮ Nonsmooth analysis on partially ordered vector spaces: the subdifferential theory ⋮ Unnamed Item ⋮ Second-order optimality conditions for nonlinear programs and mathematical programs ⋮ First order approximations to nonsmooth mappings with application to metric regularity ⋮ On lagrange-kuhn-tucker multipliers for pareto optimization problems ⋮ On solvability and regularity of a parametrized version of optimality conditions ⋮ Two-level optimization with approximate solutions in the lower level ⋮ Infinite dimensional generalized Jacobian: properties and calculus rules ⋮ Unnamed Item ⋮ DIRECTIONAL COMPACTNESS, SCALARIZATION AND NONSMOOTH SEMI-FREDHOLM MAPPINGS ⋮ Subdifferentials of nonconvex vector-valued functions ⋮ Vector subdifferentials via recession mappings∗∗this research was supported by grants from M.U.R.S.T (Itall) and the australian research council.$ef: ⋮ Generalized Newton's method based on graphical derivatives ⋮ Unnamed Item ⋮ Lagrange multipliers for multiobjective programs with a general preference ⋮ An implicit-function theorem for \(C^{0,1}\)-equations and parametric \(C^{1,1}\)-optimization ⋮ Existence of weakly efficient solutions in vector optimization ⋮ The contingent and the paratingent as generalized derivatives for vector-valued and set-valued mappings ⋮ Complete Characterization of Openness, Metric Regularity, and Lipschitzian Properties of Multifunctions ⋮ Generalized Jacobian for functions with infinite dimensional range and domain ⋮ Consistency analysis of a local Lipschitz homeomorphism of an SAA normal mapping for a parametric stochastic variational inequality ⋮ Newton methods for stationary points: an elementary view of regularity conditions and solution schemes ⋮ A generalized upper dini-directional derivation in vector optimization ⋮ Verifiable Conditions for Openness and Regularity of Multivalued Mappings in Banach Spaces ⋮ Stability Theory for Parametric Generalized Equations and Variational Inequalities Via Nonsmooth Analysis ⋮ Co-Jacobian for Lipschitzian maps ⋮ Saddlepoint Problems in Nondifferentiable Programming ⋮ Methods of variational analysis in multiobjective optimization ⋮ Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization ⋮ Nonsmooth Analysis: Differential Calculus of Nondifferentiable Mappings ⋮ Nonconvex differential calculus for infinite-dimensional multifunctions ⋮ A characterization of tangential regularity ⋮ Stability of inclusions: characterizations via suitable Lipschitz functions and algorithms ⋮ Compact nets, filters, and relations ⋮ Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization ⋮ Locally compactly Lipschitzian mappings in infinite dimensional programming ⋮ On generalized differentials and subdifferentials of Lipschitz vector-valued functions ⋮ Lipschitzian inverse functions, directional derivatives, and applications in \(C^{1,1}\) optimization
Cites Work
- Locally convex lattices
- Problème d'optimisation defini par des fonctions qui sont sommes de fonctions convexes et de fonctions derivables
- A duality theorem for a convex programming problem in order complete vector lattices
- On the inverse function theorem
- Analysis and optimization of Lipschitz continuous mappings
- Convex analysis and measurable multifunctions
- On the Strassen disintegration theorem
- Calcul sous-différentiel et optimisation
- Sur les programmes convexes definis dans des espaces vectoriels topologiques
- Ordered linear spaces
- Necessary optimality criteria in mathematical programming in normed linear spaces
- Regularity and Stability for Convex Multivalued Functions
- Problème des inégalités. Applications à la programmation et au contrôle optimal
- Generalized Gradients and Applications
- Semismooth and Semiconvex Functions in Constrained Optimization
- Optimization of lipschitz continuous functions
- A New Approach to Lagrange Multipliers
- Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
- Sous-Différentiabilité de fonctions convexes à valeurs dans un espace vectoriel ordonné.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Subdifferentials of compactly Lipschitzian vector-valued functions