On the public citation graph
A generalization of Polyak's convergence result for subgradient optimization
0 signed · 65 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-48294-6openalex-snapshot
Foundations of 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/bf01068520openalex-snapshot
Convergence conditions for nonlinear programming algorithms
inferredcites →https://doi.org/10.1007/bf01068677openalex-snapshot
The quasigradient method for the solving of the nonlinear programming problems
inferredcites →https://doi.org/10.1007/bf01580223openalex-snapshot
Validation of subgradient optimization
inferredcites →https://doi.org/10.1007/bf01584346openalex-snapshot
On convergence rates of subgradient optimization methods
inferredcites →https://doi.org/10.1016/0041-5553(69)90061-5openalex-snapshot
Minimization of unsmooth functionals
inferredcites →https://doi.org/10.1016/0166-218x(86)90087-9openalex-snapshot
The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm
inferredcites →https://doi.org/10.1016/b978-0-08-024443-3.50001-7openalex-snapshot
IIASA PROCEEDINGS SERIES
inferredcites →https://doi.org/10.1090/trans2/088/04openalex-snapshot
On systems of inequalities with convex functions in the left sides
inferredcites →https://doi.org/10.1287/mnsc.23.9.994openalex-snapshot
An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
inferredcites →https://doi.org/10.31857/s04247388openalex-snapshot
Economics and Mathematical Methods
inferredcites →https://doi.org/10.4153/cjm-1954-037-2openalex-snapshot
The Relaxation Method for Linear Inequalities
inferredcites →https://doi.org/10.4153/cjm-1954-038-xopenalex-snapshot
The Relaxation Method for Linear Inequalities
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1520-6750(199809)45:6<579::aid-nav3>3.0.co;2-#openalex-snapshot
Coordinated replenishments from multiple suppliers with price discounts
inferred← citeshttps://doi.org/10.1002/1520-6750(199004)37:2<327::aid-nav3220370210>3.0.co;2-uopenalex-snapshot
A relaxation/decomposition algorithm for the fixed charged network problem
inferred← citeshttps://doi.org/10.1002/net.3230200403openalex-snapshot
A heuristic algorithm for a network problem with variable upper bounds
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_436openalex-snapshot
Rosen’s Method, Global Convergence, and Powell’s Conjecture
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_573openalex-snapshot
Rosen’s Method, Global Convergence, and Powell’s Conjecture
inferred← citeshttps://doi.org/10.1007/978-1-4757-6594-6_11openalex-snapshot
Convergence Rate of Incremental Subgradient Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_573-1openalex-snapshot
Rosen’s Method, Global Convergence, and Powell’s Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-031-47859-8_26openalex-snapshot
Statistical Performance of Subgradient Step-Size Update Rules in Lagrangian Relaxations of Chance-Constrained Optimization Models
inferred← citeshttps://doi.org/10.1007/978-3-642-85968-7_13openalex-snapshot
An Approach to Vehicle Scheduling with Depot Capacity Constraints
inferred← citeshttps://doi.org/10.1007/bf01299389openalex-snapshot
The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
inferred← citeshttps://doi.org/10.1007/bf01582059openalex-snapshot
Inexact subgradient methods with applications in stochastic programming
inferred← citeshttps://doi.org/10.1007/bf01588797openalex-snapshot
Variable target value subgradient method
inferred← citeshttps://doi.org/10.1007/bf02094329openalex-snapshot
Configuration of fully replicated distributed database system over wide area networks
inferred← citeshttps://doi.org/10.1007/s10589-013-9602-3openalex-snapshot
An infeasible-point subgradient method using adaptive approximate projections
inferred← citeshttps://doi.org/10.1007/s10957-014-0561-3openalex-snapshot
Convergence of the Surrogate Lagrangian Relaxation Method
inferred← citeshttps://doi.org/10.1016/0096-3003(90)90029-3openalex-snapshot
Approximate solutions to large scale capacitated facility location problems
inferred← citeshttps://doi.org/10.1016/0307-904x(92)90086-iopenalex-snapshot
The K-coverage concentrator location problem
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90401-4openalex-snapshot
A surrogate heuristic for set covering problems
inferred← citeshttps://doi.org/10.1016/j.dam.2005.04.013openalex-snapshot
Lagrangean heuristics combined with reoptimization for the 0–1 bidimensional knapsack problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.07.024openalex-snapshot
Planning capacity and safety stocks in a serial production–distribution system with multiple products
inferred← citeshttps://doi.org/10.1016/j.sigpro.2006.03.030openalex-snapshot
A low complexity multicarrier PAR reduction approach based on subgradient optimization
inferred← citeshttps://doi.org/10.1016/s0016-0032(00)00021-1openalex-snapshot
A new forced LMS-based adaptive algorithm utilizing the principle of potential energy
inferred← citeshttps://doi.org/10.1016/s0022-460x(03)00500-5openalex-snapshot
Minimax optimization of multi-degree-of-freedom tuned-mass dampers
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00310-3openalex-snapshot
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00252-9openalex-snapshot
On some difficult linear programs coming from set partitioning
inferred← citeshttps://doi.org/10.1016/s0305-0548(99)00085-4openalex-snapshot
A modified subgradient algorithm for Lagrangean relaxation
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00159-xopenalex-snapshot
Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00234-2openalex-snapshot
A constrained nonlinear 0–1 program for data allocation
inferred← citeshttps://doi.org/10.1023/a:1011272319638openalex-snapshot
Limited Memory Space Dilation and Reduction Algorithms
inferred← citeshttps://doi.org/10.1080/02331934.2020.1745205openalex-snapshot
Weak subgradient method for solving nonsmooth nonconvex optimization problems
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834648openalex-snapshot
Minimizing Quantum Rényi Divergences via Mirror Descent with Polyak Step Size
inferred← citeshttps://doi.org/10.1109/tip.2002.804527openalex-snapshot
An adaptive level set method for nondifferentiable constrained image recovery
inferred← citeshttps://doi.org/10.1109/tsp.2005.849195openalex-snapshot
Fast and low complexity blind equalization via subgradient projections
inferred← citeshttps://doi.org/10.1109/tsp.2010.2050481openalex-snapshot
A Subgradient Solution to Structured Robust Least Squares Problems
inferred← citeshttps://doi.org/10.1111/j.1540-5915.1996.tb00870.xopenalex-snapshot
A Heuristic Algorithm for the Capacitated Multiple Supplier Inventory Grouping Problem
inferred← citeshttps://doi.org/10.1137/0805022openalex-snapshot
Subdifferential Convergence in Stochastic Programs
inferred← citeshttps://doi.org/10.1137/s0036144593251710openalex-snapshot
On Projection Algorithms for Solving Convex Feasibility Problems
inferred← citeshttps://doi.org/10.1137/s0363012994261483openalex-snapshot
The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
inferred← citeshttps://doi.org/10.1142/9781860949470_0006openalex-snapshot
Dynamic Resource Allocation
inferred← citeshttps://doi.org/10.12732/ijpam.v102i3.13openalex-snapshot
A SUBGRADIENT METHODS FOR NON-SMOOTH VECTOR OPTIMIZATION PROBLEMS
inferred← citeshttps://doi.org/10.1287/moor.24.1.237openalex-snapshot
The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization
inferred← citeshttps://doi.org/10.1287/opre.46.2.247openalex-snapshot
Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
inferred← citeshttps://doi.org/10.1287/opre.48.3.461.12439openalex-snapshot
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
inferred← citeshttps://doi.org/10.31801/cfsuasmas.826316openalex-snapshot
Weak subgradient method with path based target level algorithm for nonconvex optimization
inferred← citeshttps://doi.org/10.4171/dms/6/30openalex-snapshot
Subgradient optimization in nonsmooth optimization (including the soviet revolution)
inferred← citeshttps://doi.org/10.48550/arxiv.1403.7237openalex-snapshot
Subgradient Projection Operators
inferred← citeshttps://doi.org/10.48550/arxiv.2109.06054openalex-snapshot
Minimizing Quantum Renyi Divergences via Mirror Descent with Polyak Step Size
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.