On the public citation graph
A method for minimizing the sum of a convex function and a continuously differentiable function
0 signed · 31 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00935173openalex-snapshot
A minimization method for the sum of a convex function and a continuously differentiable function
inferredcites →https://doi.org/10.1007/bf01584647openalex-snapshot
Exact penalty functions in nonlinear programming
inferredcites →https://doi.org/10.1007/bf01588250openalex-snapshot
Exact penalty functions in nonlinear programming
inferredcites →https://doi.org/10.1007/bf02591907openalex-snapshot
An aggregate subgradient method for nonsmooth convex minimization
inferredcites →https://doi.org/10.1007/bfb0120960openalex-snapshot
A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
inferredcites →https://doi.org/10.1016/0022-247x(85)90061-7openalex-snapshot
An algorithm for linearly constrained convex nondifferentiable minimization problems
inferredcites →https://doi.org/10.1016/b978-0-12-468660-1.50021-9openalex-snapshot
MINIMISATION DE FONCTIONS LOCALEMENT LIPSCHITZIENNES: APPLICATIONS A LA PROGRAMMATION MI-CONVEXE, MI-DIFFERENTIABLE
inferredcites →https://doi.org/10.1080/00207728108963798openalex-snapshot
A generalized proximal point algorithm for certain non-convex minimization problems
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0367131-6openalex-snapshot
Generalized Gradients and Applications
inferredcites →https://doi.org/10.1137/0315061openalex-snapshot
Semismooth and Semiconvex Functions in Constrained Optimization
inferredcites →https://doi.org/10.1137/0321010openalex-snapshot
On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
inferredcites →https://doi.org/10.1287/moor.1.2.165openalex-snapshot
A New Approach to Lagrange Multipliers
inferredcites →https://doi.org/10.1287/moor.10.2.185openalex-snapshot
A Linearization Algorithm for Nonsmooth Minimization
inferredcites →https://doi.org/10.1287/moor.2.2.191openalex-snapshot
An Algorithm for Constrained Optimization with Semismooth Functions
inferredcites →https://doi.org/10.2307/j.ctvcm4hcj.10openalex-snapshot
Nondifferentiable Optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-662-12603-5openalex-snapshot
Nondifferentiable Optimization: Motivations and Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-12603-5_19openalex-snapshot
Descent Methods for Nonsmooth Convex Constrained Minimization
inferred← citeshttps://doi.org/10.1007/bf00429749openalex-snapshot
A parallel descent algorithm for convex programming
inferred← citeshttps://doi.org/10.1007/bf00939668openalex-snapshot
Partial linearization methods in nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf01580582openalex-snapshot
A method of linearizations for linearly constrained nonconvex nonsmooth minimization
inferred← citeshttps://doi.org/10.1007/bf01588789openalex-snapshot
A successive quadratic programming method for a class of constrained nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1007/bf02662858openalex-snapshot
A minimizing algorithm for complex nonconvex nondifferentiable functions
inferred← citeshttps://doi.org/10.1007/s10107-007-0170-0openalex-snapshot
A coordinate gradient descent method for nonsmooth separable minimization
inferred← citeshttps://doi.org/10.1007/s10957-008-9458-3openalex-snapshot
Block-Coordinate Gradient Descent Method for Linearly Constrained Nonsmooth Separable Optimization
inferred← citeshttps://doi.org/10.1080/10556788.2013.854358openalex-snapshot
A proximal alternating linearization method for nonconvex optimization problems
inferred← citeshttps://doi.org/10.1137/100817061openalex-snapshot
Karush–Kuhn–Tucker Conditions for Nonsmooth Mathematical Programming Problems in Function Spaces
inferred← citeshttps://doi.org/10.1186/s13660-018-1683-1openalex-snapshot
An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
inferred← citeshttps://doi.org/10.3934/ipi.2015.9.815openalex-snapshot
Nomonotone spectral gradient method for sparse recovery
inferred← citeshttps://doi.org/10.4208/nmtma.2009.m9002sopenalex-snapshot
A Coordinate Gradient Descent Method for Nonsmooth Nonseparable Minimization
inferred← citeshttps://doi.org/10.48550/arxiv.1404.5100openalex-snapshot
Convergence of cyclic coordinatewise l1 minimization
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.