Composite Nonsmooth Programming with Gâteaux Differentiability
From MaRDI portal
Publication:4017637
DOI10.1137/0801004zbMath0752.90067MaRDI QIDQ4017637
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
convex approximations; Gâteaux differentiable functions; subgradients; constrained nonsmooth optimization; Clarke subdifferentials; compositions of locally Lipschitz functions; Lagrangian necessary and sufficient optimality conditions
90C30: Nonlinear programming
49J52: Nonsmooth analysis
49J50: Fréchet and Gateaux differentiability in optimization
90C48: Programming in abstract spaces
Related Items
Second-order conditions in c1, 1optimization with applications, Generalized second-order derivatives and optimality conditions, Small convex-valued subdifferentials in mathematical programming, A generalized mean-value theorem and optimality conditions in composite nonsmooth minimization, Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions, Convex composite multi-objective nonsmooth programming, Sharp minima for multiobjective optimization in Banach spaces, Optimality and duality for a nonsmooth multiobjective optimization involving generalized type I functions, Optimality conditions for weak efficiency to vector optimization problems with composed convex functions, On nonlinear multiple objective fractional programming involving semilocally type-I univex functions, Second-order global optimality conditions for convex composite optimization, Nonsmooth calculus, minimality, and monotonicity of convexificators, Generalized convex functions and vector variational inequalities, First and second-order optimality conditions for convex composite multiobjective optimization, 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., Unified approaches for solvable and unsolvable linear complementarity problems, Convex composite minimization with \(C^{1,1}\) functions, Conjugate duality for multiobjective composed optimization problems, On the relations between different duals assigned to composed optimization problems, Optimality for nonsmooth fractional multiple objective programming, Farkas-type results for inequality systems with composed convex functions via conjugate duality, Multiple objective fractional programming involving semilocally type I-preinvex and related functions, Necessary optimality conditions in nondifferentiable vector optimization, Approximate generalized Hessians and Taylor’s expansions for continuously Gâteaux differentiable functions
