Composite Nonsmooth Programming with Gâteaux Differentiability
DOI10.1137/0801004zbMATH Open0752.90067OpenAlexW2055330250MaRDI QIDQ4017637FDOQ4017637
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
Recommendations
convex approximationssubgradientsconstrained nonsmooth optimizationClarke subdifferentialsGâteaux differentiable functionscompositions of locally Lipschitz functionsLagrangian necessary and sufficient optimality conditions
Nonlinear programming (90C30) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48) Fréchet and Gateaux differentiability in optimization (49J50)
Cited In (31)
- Convex composite minimization with \(C^{1,1}\) functions
- Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions.
- Characterizations of asymptotic cone of the solution set of a composite convex optimization problem
- Necessary optimality conditions in nondifferentiable vector optimization
- 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
- Unified approaches for solvable and unsolvable linear complementarity problems
- Approximate generalized Hessians and Taylor’s expansions for continuously Gâteaux differentiable functions
- Generalized second-order derivatives and optimality conditions
- On nonlinear multiple objective fractional programming involving semilocally type-I univex functions
- Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions
- Convex composite non-Lipschitz programming
- Generalized convex functions and vector variational inequalities
- Optimality and duality for a nonsmooth multiobjective optimization involving generalized type I functions
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Nonconvex composite multiobjective nonsmooth fractional programming
- Optimality for nonsmooth fractional multiple objective programming
- Second-order conditions in c1, 1optimization with applications
- Sharp Variational Conditions for Convex Composite Nonsmooth Functions
- Small convex-valued subdifferentials in mathematical programming
- Convergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditions
- Second-order global optimality conditions for convex composite optimization
- Multiple objective fractional programming involving semilocally type I-preinvex and related functions
- Asymptotic analysis in convex composite multiobjective optimization problems
- First and second-order optimality conditions for convex composite multiobjective optimization
- Convex composite multi-objective nonsmooth programming
- Optimality conditions for a class of composite multiobjective nonsmooth optimization problems
- Sharp minima for multiobjective optimization in Banach spaces
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- A generalized mean-value theorem and optimality conditions in composite nonsmooth minimization
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)
