On the public citation graph

Composite Nonsmooth Programming with Gâteaux Differentiability

https://doi.org/10.1137/0801004
0 signed · 59 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-94-009-5796-1openalex-snapshot
Mathematical Programming and Control Theory
inferredcites →https://doi.org/10.1007/bf00939737openalex-snapshot
Zero duality gaps in infinite-dimensional programming
inferredcites →https://doi.org/10.1007/bf01584377openalex-snapshot
Descent methods for composite nondifferentiable optimization problems
inferredcites →https://doi.org/10.1016/0022-247x(85)90218-5openalex-snapshot
Mean value theorems and sufficient optimality conditions for nonsmooth functions
inferredcites →https://doi.org/10.1016/0022-247x(87)90203-4openalex-snapshot
The differentiability of real functions on normed linear space using generalized subgradients
inferredcites →https://doi.org/10.1016/0196-8858(84)90015-0openalex-snapshot
Equivalence of saddle-points and optima for non-concave programmes
inferredcites →https://doi.org/10.1016/0378-4754(88)90129-2openalex-snapshot
Practical methods of optimization
inferredcites →https://doi.org/10.1080/01630568008816042openalex-snapshot
Mean value theorems in nonsmooth analysis
inferredcites →https://doi.org/10.1080/01630568708816246openalex-snapshot
On optimality conditions in nonsmooth inequality constrained minimization
inferredcites →https://doi.org/10.1080/02331938508843061openalex-snapshot
Convexlike alternative theorems and mathematical programming
inferredcites →https://doi.org/10.1090/s0002-9947-1987-0891640-2openalex-snapshot
Convex Subcones of the Contingent Cone in Nonsmooth Calculus and Optimization
inferredcites →https://doi.org/10.1090/s0002-9947-1988-0936806-9openalex-snapshot
First- and Second-Order Epi-Differentiability in Nonlinear Programming
inferredcites →https://doi.org/10.1137/0317020openalex-snapshot
Necessary and Sufficient Conditions for a Local Minimum. 2: Conditions of Levitin–Miljutin–Osmolovskii Type
inferredcites →https://doi.org/10.1137/0325072openalex-snapshot
Nonsmooth Calculus in Finite Dimensions
inferredcites →https://doi.org/10.1137/1.9781611970524openalex-snapshot
Conjugate Duality and Optimization
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1287/moor.7.3.463openalex-snapshot
On Sufficient Conditions in Nonsmooth Optimization
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.2307/2005191openalex-snapshot
Necessary Conditions for an Extremum
inferredcites →https://doi.org/10.4153/cjm-1980-020-7openalex-snapshot
Generalized Directional Derivatives and Subgradients of Nonconvex Functions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-306-48332-7_66openalex-snapshot
Composite Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/0-387-26771-9_10openalex-snapshot
Generalized Lagrange Multipliers for Nonconvex Directionally Differentiable Programs
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_82openalex-snapshot
Composite Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_82-1openalex-snapshot
Composite Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-46802-5_16openalex-snapshot
Abstract nonsmooth nonconvex programming
inferred← citeshttps://doi.org/10.1007/bf00940559openalex-snapshot
Generalized convex functions and vector variational inequalities
inferred← citeshttps://doi.org/10.1007/bf01580087openalex-snapshot
Second-order global optimality conditions for convex composite optimization
inferred← citeshttps://doi.org/10.1007/bf01581251openalex-snapshot
Convex composite multi-objective nonsmooth programming
inferred← citeshttps://doi.org/10.1007/bf02192162openalex-snapshot
Convex composite minimization withC 1,1 functions
inferred← citeshttps://doi.org/10.1007/s00186-007-0169-6openalex-snapshot
On the relations between different duals assigned to composed optimization problems
inferred← citeshttps://doi.org/10.1007/s00186-007-0202-9openalex-snapshot
Optimality and duality for a nonsmooth multiobjective optimization involving generalized type I functions
inferred← citeshttps://doi.org/10.1007/s10474-007-4273-0openalex-snapshot
Conjugate duality for multiobjective composed optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-012-0032-zopenalex-snapshot
Asymptotic analysis in convex composite multiobjective optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-012-9957-5openalex-snapshot
Optimality conditions for a class of composite multiobjective nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1007/s11228-006-0023-7openalex-snapshot
Sharp Minima for Multiobjective Optimization in Banach Spaces
inferred← citeshttps://doi.org/10.1007/s11590-008-0099-0openalex-snapshot
On nonlinear multiple objective fractional programming involving semilocally type-I univex functions
inferred← citeshttps://doi.org/10.1016/0362-546x(94)00122-xopenalex-snapshot
A generalized mean-value theorem and optimality conditions in composite nonsmooth minimization
inferred← citeshttps://doi.org/10.1016/0362-546x(94)90218-6openalex-snapshot
Generalized second-order derivatives and optimality conditions
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.06.014openalex-snapshot
Unified approaches for solvable and unsolvable linear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.jmaa.2005.02.032openalex-snapshot
Multiple objective fractional programming involving semilocally type I-preinvex and related functions
inferred← citeshttps://doi.org/10.1016/j.jmaa.2005.09.007openalex-snapshot
Farkas-type results for inequality systems with composed convex functions via conjugate duality
inferred← citeshttps://doi.org/10.1016/j.na.2007.02.033openalex-snapshot
Optimality for nonsmooth fractional multiple objective programming
inferred← citeshttps://doi.org/10.1016/s0022-247x(02)00460-2openalex-snapshot
Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions
inferred← citeshttps://doi.org/10.1016/s0362-546x(98)00058-3openalex-snapshot
Approximate generalized Hessians and Taylor’s expansions for continuously Gâteaux differentiable functions
inferred← citeshttps://doi.org/10.1017/s0334270000010444openalex-snapshot
Smoothing approximations to nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1023/a:1021790120780openalex-snapshot
Nonsmooth Calculus, Minimality, and Monotonicity of Convexificators
inferred← citeshttps://doi.org/10.1023/a:1022503820909openalex-snapshot
Convergence Analysis of a Class of Nonlinear Penalization Methods for Constrained Optimization via First-Order Necessary Optimality Conditions
inferred← citeshttps://doi.org/10.1023/a:1022695714596openalex-snapshot
First and Second-Order Optimality Conditions for Convex Composite Multiobjective Optimization
inferred← citeshttps://doi.org/10.1080/01630569308816543openalex-snapshot
Second-order conditions in c 1, 1 optimization with applications
inferred← citeshttps://doi.org/10.1080/02331930108844561openalex-snapshot
Necessary optimality conditions in nondifferentiable vector optimization
inferred← citeshttps://doi.org/10.1080/02331939208843851openalex-snapshot
Generalized second-order directional derivatives and optimization with C 1,1 functions
inferred← citeshttps://doi.org/10.1080/02331939508844032openalex-snapshot
Small convex-valued subdifferentials in mathematical programming
inferred← citeshttps://doi.org/10.1080/02331939608844179openalex-snapshot
Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions
inferred← citeshttps://doi.org/10.1137/s0363012996311745openalex-snapshot
Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C 1 -Optimization
inferred← citeshttps://doi.org/10.1137/s1052623401396509openalex-snapshot
Sharp Variational Conditions for Convex Composite Nonsmooth Functions
inferred← citeshttps://doi.org/10.1155/2012/617485openalex-snapshot
Characterizations of Asymptotic Cone of the Solution Set of a Composite Convex Optimization Problem
inferred← citeshttps://doi.org/10.1186/1029-242x-2013-508openalex-snapshot
Nonconvex composite multiobjective nonsmooth fractional programming
inferred← citeshttps://doi.org/10.1287/moor.18.4.982openalex-snapshot
Semiregularity and Generalized Subdifferentials with Applications to Optimization
inferred← citeshttps://doi.org/10.2478/s11533-008-0036-6openalex-snapshot
Optimality conditions for weak efficiency to vector optimization problems with composed convex functions
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.