On the public citation graph

New variable-metric algorithms for nondifferentiable optimization problems

0 signed · 44 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-1-4613-9447-1_2openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.1007/978-3-642-61370-8openalex-snapshot
Numerical Techniques for Stochastic Optimization
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-642-82450-0_12openalex-snapshot
Nondifferentiable Optimization
inferredcites →https://doi.org/10.1007/978-3-662-12603-5_11openalex-snapshot
On Some Nondifferentiable Problems in Optimal Control
inferredcites →https://doi.org/10.1007/bf01027107openalex-snapshot
Newton's method for a class of nonsmooth functions
inferredcites →https://doi.org/10.1007/bfb0074500openalex-snapshot
Methods of Descent for Nondifferentiable 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.1016/0005-1098(73)90088-5openalex-snapshot
Discrete optimal control with multiple constraints I Constraint separation and transformation technique
inferredcites →https://doi.org/10.1137/0309037openalex-snapshot
Generalized Cutting Plane Algorithms
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/1019005openalex-snapshot
Quasi-Newton Methods, Motivation and Theory
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.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-1-4613-3279-4_22openalex-snapshot
New Derivative Formulas for Integral and Probability Functions: Parallel Computations
inferred← citeshttps://doi.org/10.1007/978-1-4757-3150-7_3openalex-snapshot
On Optimization of Unreliable Material Flow Systems
inferred← citeshttps://doi.org/10.1007/978-1-4757-5233-5_5openalex-snapshot
Nonsmooth Optimization Methods
inferred← citeshttps://doi.org/10.1007/978-1-4757-6594-6_17openalex-snapshot
Conditional Value-at-Risk: Optimization Approach
inferred← citeshttps://doi.org/10.1007/978-3-030-37826-4_3openalex-snapshot
Nonsmooth Optimization Methods
inferred← citeshttps://doi.org/10.1007/978-3-031-76512-4_3openalex-snapshot
Nonsmooth Optimization Methods
inferred← citeshttps://doi.org/10.1007/978-94-007-5288-7_15openalex-snapshot
Subgradient and Bundle Methods for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/bf02060944openalex-snapshot
A stochastic quasigradient algorithm with variable metric
inferred← citeshttps://doi.org/10.1007/s10589-008-9196-3openalex-snapshot
Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization
inferred← citeshttps://doi.org/10.1007/s10957-014-0666-8openalex-snapshot
Diagonal Bundle Method for Nonsmooth Sparse Optimization
inferred← citeshttps://doi.org/10.1007/s11760-015-0815-zopenalex-snapshot
Control subgradient algorithm for image $$\ell _1$$ ℓ 1 regularization
inferred← citeshttps://doi.org/10.1007/s11760-020-01696-2openalex-snapshot
Fast gradient descent algorithm for image classification with neural networks
inferred← citeshttps://doi.org/10.1007/s40314-023-02307-9openalex-snapshot
Stochastic perturbation of subgradient algorithm for nonconvex deep neural networks
inferred← citeshttps://doi.org/10.1016/0951-8320(93)90028-wopenalex-snapshot
Optimization of test strategies: a general approach
inferred← citeshttps://doi.org/10.1016/s0045-7949(98)00082-0openalex-snapshot
A computerised method for rigid-plastic yield-line analysis of slabs
inferred← citeshttps://doi.org/10.1061/(asce)0733-9496(2007)133:6(486)openalex-snapshot
Stochastically Optimal Groundwater Management Considering Land Subsidence
inferred← citeshttps://doi.org/10.1080/02331934.2012.687736openalex-snapshot
Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
inferred← citeshttps://doi.org/10.1080/02331934.2024.2322152openalex-snapshot
A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
inferred← citeshttps://doi.org/10.1080/10556780290027828openalex-snapshot
Survey of Bundle Methods for Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/10556788.2010.526116openalex-snapshot
Comparing different nonsmooth minimization methods and software
inferred← citeshttps://doi.org/10.1080/10556788.2021.2023522openalex-snapshot
A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
inferred← citeshttps://doi.org/10.1201/b15334-10openalex-snapshot
Basic Principles of 4–D VAR
inferred← citeshttps://doi.org/10.1201/b15334-5openalex-snapshot
Basic Principles of 4-D VAR
inferred← citeshttps://doi.org/10.2316/p.2011.736-033openalex-snapshot
Optimal Groundwater Quantity Management for Land Subsidence Control
inferred← citeshttps://doi.org/10.2478/v10006-011-0024-zopenalex-snapshot
Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints
inferred← citeshttps://doi.org/10.2514/1.j060539openalex-snapshot
Certifiable Risk-Based Engineering Design Optimization
inferred← citeshttps://doi.org/10.2514/6.2020-2130openalex-snapshot
Risk-Based Design Optimization Via Probability of Failure, Conditional Value-at-Risk, and Buffered Probability of Failure
inferred← citeshttps://doi.org/10.48550/arxiv.1907.01321openalex-snapshot
A Gradient Sampling method based on Ideal direction for solving nonsmooth nonconvex optimization problems: convergence analysis and numerical experiments
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.