On the public citation graph
A method of linearizations for linearly constrained nonconvex nonsmooth minimization
0 signed · 30 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/bf00938396openalex-snapshot
Optimization of upper semidifferentiable functions
inferredcites →https://doi.org/10.1007/bf00940570openalex-snapshot
A method for minimizing the sum of a convex function and a continuously differentiable function
inferredcites →https://doi.org/10.1007/bf01588966openalex-snapshot
Linearly constrained minimax optimization
inferredcites →https://doi.org/10.1007/bf02591907openalex-snapshot
An aggregate subgradient method for nonsmooth convex minimization
inferredcites →https://doi.org/10.1007/bf02594782openalex-snapshot
ε-Optimal solutions in nondifferentiable convex programming and some related questions
inferredcites →https://doi.org/10.1007/bfb0008904openalex-snapshot
A linearization algorithm for constrained nonsmooth minimization
inferredcites →https://doi.org/10.1007/bfb0008907openalex-snapshot
An algorithm for minimizing nondifferentiable convex functions under linear constraints
inferredcites →https://doi.org/10.1007/bfb0074500openalex-snapshot
Methods of Descent for Nondifferentiable Optimization
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-468662-5.50015-xopenalex-snapshot
ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATION
inferredcites →https://doi.org/10.1093/imanum/6.2.137openalex-snapshot
A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth 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.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
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.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
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-21637-8_11openalex-snapshot
Issues of Effectiveness Arising in the Design of a System of Nondifferentiable Optimization Algorithms
inferred← citeshttps://doi.org/10.1007/bf01582892openalex-snapshot
Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
inferred← citeshttps://doi.org/10.1007/bf01585731openalex-snapshot
Proximity control in bundle methods for convex nondifferentiable minimization
inferred← citeshttps://doi.org/10.1016/j.amc.2007.08.044openalex-snapshot
Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
inferred← citeshttps://doi.org/10.1016/j.camwa.2007.11.034openalex-snapshot
A bundle-type auxiliary problem method for solving generalized variational-like inequalities
inferred← citeshttps://doi.org/10.1023/a:1011990503369openalex-snapshot
Globally Convergent Variable Metric Method for Nonconvex Nondifferentiable Unconstrained Minimization
inferred← citeshttps://doi.org/10.1080/02331930902884398openalex-snapshot
Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
inferred← citeshttps://doi.org/10.1080/10556780290027828openalex-snapshot
Survey of Bundle Methods for Nonsmooth 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/0806013openalex-snapshot
Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
inferred← citeshttps://doi.org/10.2208/jscej.2002.715_147openalex-snapshot
PREDICTION AND ASSESSMENT OF RECLAMATION BY DREDGED MARINE CLAY
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.