Composite Nonsmooth Programming with Gâteaux Differentiability

DOI10.1137/0801004MaRDI QIDQ4017637zbMATH OpenOpenAlexFDO

Authors V. 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 approximationssubgradientsconstrained nonsmooth optimizationClarke subdifferentialsGâteaux differentiable functionscompositions of locally Lipschitz functionsLagrangian necessary and sufficient optimality conditions

Mathematics Subject Classification ID

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

Recommendations

• Convex composite non-Lipschitz programming
• Convex composite multi-objective nonsmooth programming
• scientific article; zbMATH DE number 24411
• Nondifferentiable optimization by smooth approximations
• Sharp Variational Conditions for Convex Composite Nonsmooth Functions

Cited in

(31)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017637)