scientific article; zbMATH DE number 2190119
From MaRDI portal
Publication:5462177
zbMath1105.90104MaRDI QIDQ5462177
Publication date: 1 August 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48) Variational principles in infinite-dimensional spaces (58E30) Differentiation theory (Gateaux, Fréchet, etc.) on manifolds (58C20) Optimality conditions for problems in abstract spaces (49K27)
Related Items (24)
Necessary conditions for non-intersection of collections of sets ⋮ Primal necessary characterizations of transversality properties ⋮ Dual sufficient characterizations of transversality properties ⋮ On semiregularity of mappings ⋮ About extensions of the extremal principle ⋮ Some new characterizations of intrinsic transversality in Hilbert spaces ⋮ Set regularities and feasibility problems ⋮ Stationarity and regularity of infinite collections of sets: applications to infinitely constrained optimization ⋮ Geometric and metric characterizations of transversality properties ⋮ Stationarity and regularity of infinite collections of sets ⋮ About \([q\)-regularity properties of collections of sets] ⋮ Special Issue dedicated to the 65th birthday of Alexander Kruger ⋮ About intrinsic transversality of pairs of sets ⋮ About subtransversality of collections of sets ⋮ Prox-regularity of rank constraint sets and implications for algorithms ⋮ Metric regularity and systems of generalized equations ⋮ Quantitative characterizations of regularity properties of collections of sets ⋮ Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets ⋮ About regularity of collections of sets ⋮ A convergent relaxation of the Douglas-Rachford algorithm ⋮ Unnamed Item ⋮ Transversality properties: primal sufficient conditions ⋮ Extremality, stationarity and generalized separation of collections of sets ⋮ Metric subregularity and the proximal point method
This page was built for publication: