Composite Nonsmooth Programming with Gâteaux Differentiability

DOI10.1137/0801004zbMath0752.90067OpenAlexW2055330250MaRDI QIDQ4017637

Vaithilingam Jeyakumar

Publication date: 16 January 1993

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

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

zbMATH Keywords

convex approximationsGâteaux differentiable functionssubgradientsconstrained nonsmooth optimizationClarke subdifferentialscompositions of locally Lipschitz functionsLagrangian necessary and sufficient optimality conditions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52) Fréchet and Gateaux differentiability in optimization (49J50) Programming in abstract spaces (90C48)

Related Items (29)

Unified approaches for solvable and unsolvable linear complementarity problems ⋮ Sharp minima for multiobjective optimization in Banach spaces ⋮ Convex composite minimization with \(C^{1,1}\) functions ⋮ Second-order conditions in c^{1, 1}optimization with applications ⋮ First and second-order optimality conditions for convex composite multiobjective optimization ⋮ A generalized mean-value theorem and optimality conditions in composite nonsmooth minimization ⋮ Optimality conditions for a class of composite multiobjective nonsmooth optimization problems ⋮ Generalized second-order derivatives and optimality conditions ⋮ Asymptotic analysis in convex composite multiobjective optimization problems ⋮ Convergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditions ⋮ Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions. ⋮ Optimality and duality for a nonsmooth multiobjective optimization involving generalized type I functions ⋮ Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions ⋮ Conjugate duality for multiobjective composed optimization problems ⋮ Optimality conditions for weak efficiency to vector optimization problems with composed convex functions ⋮ On the relations between different duals assigned to composed optimization problems ⋮ Convex composite multi-objective nonsmooth programming ⋮ Nonconvex composite multiobjective nonsmooth fractional programming ⋮ Characterizations of asymptotic cone of the solution set of a composite convex optimization problem ⋮ Optimality for nonsmooth fractional multiple objective programming ⋮ Necessary optimality conditions in nondifferentiable vector optimization ⋮ Farkas-type results for inequality systems with composed convex functions via conjugate duality ⋮ On nonlinear multiple objective fractional programming involving semilocally type-I univex functions ⋮ Second-order global optimality conditions for convex composite optimization ⋮ Multiple objective fractional programming involving semilocally type I-preinvex and related functions ⋮ Nonsmooth calculus, minimality, and monotonicity of convexificators ⋮ Small convex-valued subdifferentials in mathematical programming ⋮ Approximate generalized Hessians and Taylor’s expansions for continuously Gâteaux differentiable functions ⋮ Generalized convex functions and vector variational inequalities

This page was built for publication: Composite Nonsmooth Programming with Gâteaux Differentiability