Nonsmooth Optimization Using Mordukhovich's Subdifferential

DOI10.1137/070710664zbMath1204.47095OpenAlexW2070793005MaRDI QIDQ3162594

Majid Soleimani-damaneh

Publication date: 20 October 2010

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070710664

zbMATH Keywords

penalizationoptimality conditionsPareto optimalityMordukhovich subdifferentialinfinite programmingAsplund space

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Optimization problems in solid mechanics (74P99) Convexity of real functions in one variable, generalizations (26A51) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Convexity of real functions of several variables, generalizations (26B25) Mean value and transfer theorems (11H60)

Related Items (29)

Proper minimal points of nonconvex sets in Banach spaces in terms of the limiting normal cone ⋮ Optimality conditions in convex multiobjective SIP ⋮ Strongly proper efficient solutions: efficient solutions with bounded trade-offs ⋮ On compromise solutions in multiple objective programming ⋮ Duality in nondifferentiable minimax fractional programming with \(B-(p, r)\)-invexity ⋮ Optimality conditions in optimization problems with convex feasible set using convexificators ⋮ Sensitivity analysis for generalized nonlinear parametric \((A,\eta ,m)\)-maximal monotone operator inclusion systems with relaxed cocoercive type operators ⋮ Infinite alternative theorems and nonsmooth constraint qualification conditions ⋮ Duality for fractional interval-valued optimization problem via convexificator ⋮ \(E\)-subdifferential of \(E\)-convex functions and its applications to minimization problem ⋮ Multiobjective program with support functions under \((G,C,\rho)\)-convexity assumptions ⋮ On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization ⋮ A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems ⋮ Scalarization of set-valued optimization problems and variational inequalities in topological vector spaces ⋮ Derivatives of set-valued maps and gap functions for vector equilibrium problems ⋮ Optimality conditions and duality in nonsmooth multiobjective optimization problems ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods ⋮ Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators ⋮ On gap functions for nonsmooth multiobjective optimization problems ⋮ On Benson's scalarization in multiobjective optimization ⋮ Duality for optimization problems in Banach algebras ⋮ On value efficiency ⋮ On Efficient Solutions with Trade-Offs Bounded by Given Values ⋮ Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization ⋮ Anchor points in multiobjective optimization: definition, characterization and detection ⋮ Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization ⋮ Generalized vector variational-like inequalities and vector optimization in Asplund spaces ⋮ A differential inclusion-based approach for solving nonsmooth convex optimization problems ⋮ Approximate solutions of multiobjective optimization problems

This page was built for publication: Nonsmooth Optimization Using Mordukhovich's Subdifferential