Publication:3923954
From MaRDI portal
zbMath0469.90071MaRDI QIDQ3923954
Publication date: 1979
Full work available at URL: http://www.numdam.org/item?id=MSMF_1979__60__57_0
surveyClarke's tangent conegeneralized gradientchain rulesconical approximationsnondifferentiable nonconvex optimization
Nonlinear programming (90C30) Normed linear spaces and Banach spaces; Banach lattices (46B99) Programming in abstract spaces (90C48) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Scalarization and optimality conditions for the approximate solutions to vector variational inequalities in Banach spaces, Variants of the Ekeland variational principle for a set-valued map involving the Clarke normal cone, Properties of generalized differentials, Stability on parametric strong symmetric quasi-equilibrium problems via nonlinear scalarization, First and second order optimality conditions in vector optimization problems with nontransitive preference relation, Newton-like methods for efficient solutions in vector optimization, A Hausdorff-type distance, a directional derivative of a set-valued map and applications in set optimization, The Ekeland variational principle for Henig proper minimizers and super minimizers, Relationships between the oriented distance functional and a nonlinear separation functional, An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems, Optimality conditions and a barrier method in optimization with convex geometric constraint, Condition Number Minimization in Euclidean Jordan Algebras, Geoffrion type characterization of higher-order properly efficient points in vector optimization, Convex analysis of minimal time and signed minimal time functions, Sequential formulae for the normal cone to sublevel sets, Convex optimization without convexity of constraints on non-necessarily convex sets and its applications in customer satisfaction in automotive industry, Optimality conditions for weak \({\psi}\) -sharp minima in vector optimization problems, Optimality conditions for convex problems on intersections of non necessarily convex sets, On scalar and vector \(\ell \)-stable functions, Constraint qualifications in nonsmooth optimization: Classification and inter-relations, A set scalarization function and Dini directional derivatives with applications in set optimization problems, Sublevel representations of epi-Lipschitz sets and other properties, Second order sufficient optimality conditions in vector optimization, A new approach to characterize the solution set of a pseudoconvex programming problem, Unified duality theory for constrained extremum problems. II: Special duality schemes, Lagrange multipliers in convex set optimization with the set and vector criteria, Vectorial penalisation in vector optimisation in real linear-topological spaces, Unnamed Item, A geometric approach to nonsmooth optimization with sample applications, Properties of the nonlinear scalar functional and its applications to vector optimization problems, Error bound results for convex inequality systems via conjugate duality, Hadamard well-posedness for a set-valued optimization problem, Efficiency of higher-order algorithms for minimizing composite functions, Connectedness of the solution sets in generalized semi-infinite set optimization, Technical note on the existence of solutions for generalized symmetric set-valued quasi-equilibrium problems utilizing improvement set, Nonlinear Cone Separation Theorems in Real Topological Linear Spaces, Existence and optimality conditions for approximate solutions to vector optimization problems, On closures of preimages of metric projection mappings in Hilbert spaces, Asymptotics for some proximal-like method involving inertia and memory aspects, Asymptotic analysis of scalarization functions and applications, Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty, Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems, Optimality conditions for weak and firm efficiency in set-valued optimization, On a general class of matrix nearness problems, Chain rules for nonsmooth functions, Variational analysis on the signed distance functions, Painlevé–Kuratowski Convergence of Solutions for Perturbed Symmetric Set-Valued Quasi-Equilibrium Problem via Improvement Sets, Optimality conditions for nonsmooth multiobjective optimization using Hadamard directional derivatives, Finitely convergent iterative methods with overrelaxations revisited, The contingent and the paratingent as generalized derivatives for vector-valued and set-valued mappings, An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems, From scalar to vector optimization., Slopes, error bounds and weak sharp Pareto minima of a vector-valued map, Nonsmooth Optimization, Condition numbers and error bounds in convex programming, Remarks on strict efficiency in scalar and vector optimization, Equilibrium in multi-criteria supply and demand networks with capacity constraints, Stability of properly efficient points and isolated minimizers of constrained vector optimization problems, Prescribing tangent hyperplanes to $C^{1,1}$ and $C^{1,\omega}$ convex hypersurfaces in Hilbert and superreflexive Banach spaces, A note on Minty type vector variational inequalities, First-order optimality conditions in set-valued optimization, Necessary optimality conditions for weak sharp minima in set-valued optimization, Feedback in state constrained optimal control, Unnamed Item, Some properties of nonconvex oriented distance function and applications to vector optimization problems, On the stability of solutions for the generalized vector quasi-equilibrium problems via free-disposal set, Equilibria of set-valued maps: A variational approach, A note on the generalized differentiability of mappings, Estimates of Error Bounds for Some Sets of Efficient Solutions of a Set-Valued Optimization Problem, Unnamed Item, Merit functions in vector optimization, Approximation operators in optimization theory, A new concept of slope for set-valued maps and applications in set optimization studied with Kuroiwa's set approach, On the efficiency and optimality of random allocations, A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data, Extension of Lipschitz functions, A characterization of tangential regularity, An Oriented Distance Function Application to Gap Functions for Vector Variational Inequalities, Isolated minimizers and proper efficiency for \(C^{0,1}\) constrained vector optimization problems, A unified characterization of nonlinear scalarizing functionals in optimization, Lagrange multipliers for set-valued optimization problems associated with coderivatives, Compact nets, filters, and relations, Unnamed Item, Second-order conditions in \(C^{1,1}\) constrained vector optimization, Necessary optimality conditions for differential–difference inclusions, Some characterizations of a nonlinear scalarizing function via oriented distance function, Connectedness of the approximate solution sets for set optimization problems, On generalized differentials and subdifferentials of Lipschitz vector-valued functions, Calculus for parabolic second-order derivatives
Cites Work
- Generalized gradients of Lipschitz functionals
- On the inverse function theorem
- Interior mapping theorem with set-valued derivatives
- On the differentiability almost everywhere of functions of many variables
- Optimality conditions and constraint qualifications in Banach space
- La méthode des centres dans un espace topologique
- Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
- On the cones of tangents with applications to mathematical programming
- Generic Differentiability of Lipschitzian Functions
- Strong Derivatives and Inverse Mappings
- Various definitions of the derivative in mathematical programming
- Generalized Gradients and Applications
- THE METHOD OF TENTS IN THE THEORY OF EXTREMAL PROBLEMS
- Nonlinear programming without differentiability in banach spaces: necessary and sufficient constraint qualification
- Sufficient Fritz John optimality conditions for nondifferentiable convex programming
- Fractional programming without differentiability
- On optimality conditions in nondifferentiable programming
- Gradients Généralisés de Fonctions Marginales
- Optimization of lipschitz continuous functions
- A New Approach to Lagrange Multipliers
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Extension of optimality conditions via supporting functions
- Geometry of optimality conditions and constraint qualifications
- Convex Analysis
- Sur les inégalités linéaires
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item