scientific article; zbMATH DE number 823381
From MaRDI portal
Publication:4856868
zbMath0838.49013MaRDI QIDQ4856868
Boris S. Mordukhovich, Yongheng Shao
Publication date: 5 December 1995
Full work available at URL: https://eudml.org/doc/227216
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonsmooth analysis (49J52) Differentiation theory (Gateaux, Fréchet, etc.) on manifolds (58C20) Derivatives of functions in infinite-dimensional spaces (46G05)
Related Items (42)
Calculus of directional subdifferentials and coderivatives in Banach spaces ⋮ Optimality conditions and duality for interval-valued optimization problems using convexifactors ⋮ Optimality conditions for pessimistic bilevel problems using convexificator ⋮ On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians ⋮ Necessary optimality conditions in terms of convexificators in Lipschitz optimization ⋮ Unnamed Item ⋮ Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications ⋮ Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method ⋮ Second-order optimality conditions for nonlinear programs and mathematical programs ⋮ A nonconvex model with minimax concave penalty for image restoration ⋮ Applying directional upper semi-regular convexificators in bilevel optimization ⋮ On strong limiting subdifferential calculus in separable binormed spaces ⋮ Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints ⋮ Optimality conditions for MPECs in terms of directional upper convexifactors ⋮ Sufficient optimality conditions and Mond-Weir duality results for a fractional multiobjective optimization problem ⋮ Subdifferential of optimal value functions in nonlinear infinite programming ⋮ Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem ⋮ Necessary optimality conditions for bilevel set optimization problems ⋮ Nonsmooth sequential analysis in Asplund spaces ⋮ Optimality and duality in constrained interval-valued optimization ⋮ Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators ⋮ Multiobjective Problems: Enhanced Necessary Conditions and New Constraint Qualifications through Convexificators ⋮ Efficiency conditions for multiobjective bilevel programming problems via convexificators ⋮ Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation ⋮ Optimality conditions for a multiobjective bilevel optimization problem involving set valued constraints ⋮ Necessary and sufficient conditions for efficiency via convexificators ⋮ Convexificators and strong Kuhn-Tucker conditions ⋮ Unnamed Item ⋮ Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials ⋮ Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods ⋮ Weak-subdifferentials for vector functions and applications to multiobjective semi-infinite optimization problems ⋮ On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators ⋮ Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation ⋮ Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications ⋮ Necessary optimality conditions for set-valued optimization problems via the extremal principle ⋮ A new Abadie-type constraint qualification for general optimization problems ⋮ Optimality conditions for multiobjective fractional programming, via convexificators ⋮ Continuous outer subdifferentials in nonsmooth optimization ⋮ Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming ⋮ Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators ⋮ Optimality and duality for nonsmooth minimax programming problems using convexifactor ⋮ Optimality conditions for nonsmooth semidefinite programming via convexificators
This page was built for publication:
