On the public citation graph
A descent method with linear programming subproblems for nondifferentiable convex optimization
0 signed · 37 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/978-3-642-82118-9openalex-snapshot
Minimization Methods for Non-Differentiable Functions
inferredcites →https://doi.org/10.1007/978-3-662-12603-5openalex-snapshot
Nondifferentiable Optimization: Motivations and Applications
inferredcites →https://doi.org/10.1007/bf01583790openalex-snapshot
A bundle type approach to the unconstrained minimization of convex nonsmooth functions
inferredcites →https://doi.org/10.1007/bf01585731openalex-snapshot
Proximity control in bundle methods for convex nondifferentiable minimization
inferredcites →https://doi.org/10.1007/bf01588797openalex-snapshot
Variable target value subgradient method
inferredcites →https://doi.org/10.1007/bf01594925openalex-snapshot
Convergence of a generalized subgradient method for nondifferentiable convex optimization
inferredcites →https://doi.org/10.1007/bf02591883openalex-snapshot
A descent algorithm for nonsmooth convex optimization
inferredcites →https://doi.org/10.1007/bfb0120703openalex-snapshot
A method of conjugate subgradients for minimizing nondifferentiable functions
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.1007/bfb0121157openalex-snapshot
Numerical methods for nondifferentiable convex optimization
inferredcites →https://doi.org/10.1016/0041-5553(69)90061-5openalex-snapshot
Minimization of unsmooth functionals
inferredcites →https://doi.org/10.1137/0108053openalex-snapshot
The Cutting-Plane Method for Solving Convex Programs
inferredcites →https://doi.org/10.1137/0311049openalex-snapshot
A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0327039openalex-snapshot
An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
inferredcites →https://doi.org/10.1287/mnsc.8.4.442openalex-snapshot
A Method of Solution for Quadratic Programs
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.1002/net.20137openalex-snapshot
Acceleration of cutting‐plane and column generation algorithms: Applications to network design
inferred← citeshttps://doi.org/10.1007/0-387-25486-2_12openalex-snapshot
Implementing Mixed Integer Column Generation
inferred← citeshttps://doi.org/10.1007/s10107-006-0079-zopenalex-snapshot
Comparison of bundle and classical column generation
inferred← citeshttps://doi.org/10.1007/s10107-007-0178-5openalex-snapshot
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
inferred← citeshttps://doi.org/10.1007/s10288-010-0130-zopenalex-snapshot
A tutorial on column generation and branch-and-price for vehicle routing problems
inferred← citeshttps://doi.org/10.1007/s10589-018-0048-5openalex-snapshot
A simple version of bundle method with linear programming
inferred← citeshttps://doi.org/10.1007/s10898-025-01485-6openalex-snapshot
Bundle trust region algorithm based on linear subproblem
inferred← citeshttps://doi.org/10.1016/j.cor.2004.08.003openalex-snapshot
A proximal trust-region algorithm for column generation stabilization
inferred← citeshttps://doi.org/10.1016/j.dam.2008.06.021openalex-snapshot
On the choice of explicit stabilizing terms in column generation
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.03.031openalex-snapshot
Lower bounding procedure for the asymmetric quadratic traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2026.134154openalex-snapshot
Optimal service and charging scheduling of electric vehicle demand-responsive connectors considering multiple trips
inferred← citeshttps://doi.org/10.1016/j.orl.2006.11.004openalex-snapshot
Interior point stabilization for column generation
inferred← citeshttps://doi.org/10.1155/2013/824961openalex-snapshot
Column Generation for a Multitrip Vehicle Routing Problem with Time Windows, Driver Work Hours, and Heterogeneous Fleet
inferred← citeshttps://doi.org/10.11606/t.3.2013.tde-09072014-111258openalex-snapshot
Heuristic and exact methods applied to a rich vehicle routing and scheduling problem.
inferred← citeshttps://doi.org/10.1287/ijoc.1100.0415openalex-snapshot
New Stabilization Procedures for the Cutting Stock Problem
inferred← citeshttps://doi.org/10.70675/1468ff30zd537z4e95z9cd6zff8551bcc1ebopenalex-snapshot
Méthodes exactes pour les problèmes combinatoires bi-objectif : Application sur les problèmes de tournées de véhicules
inferred← citeshttps://doi.org/10.70675/efe85bb0z29aez4e3ez80bdz0187cd6b076eopenalex-snapshot
Column Generation for Bi-Objective Integer Linear Programs : Application to Bi-Objective Vehicle Routing Problems
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.