Chain rules for approximate Jacobians of continuous functions
From MaRDI portal
Publication:1776931
DOI10.1016/j.na.2004.11.016zbMath1090.90199OpenAlexW4253338966MaRDI QIDQ1776931
Publication date: 12 May 2005
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2004.11.016
Related Items
Equi-surjective systems of linear operators and applications ⋮ On constraint qualifications in terms of approximate Jacobians for nonsmooth continuous optimization problems ⋮ Constraint qualifications for constrained Lipschitz optimization problems and applications to a MPCC ⋮ Inversion of nonsmooth maps between Banach spaces ⋮ Global inversion of nonsmooth mappings using pseudo-Jacobian matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Second-order optimality conditions for \(C^1\) multiobjective programming problems
- Fat homeomorphisms and unbounded derivate containers
- Generalized differential calculus for nonsmooth and set-valued mappings
- Convex composite non-Lipschitz programming
- An open mapping theorem using unbounded generalized Jacobians
- Recession maps and applications
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- Approximate Hessian matrices and second-order optimality conditions for nonlinear programming problems with C1-data
- Complete Characterization of Openness, Metric Regularity, and Lipschitzian Properties of Multifunctions
- A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
- A survey of subdifferential calculus with applications
- A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
- Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems.
