On the public citation graph

Convergence rate of the gradient descent method with dilatation of the space

https://doi.org/10.1007/bf01070506
0 signed · 70 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 points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/0471787779.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9780471703778.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/net.3230130106openalex-snapshot
Activity selection games and the minimum‐cut problem
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_343openalex-snapshot
Nondifferentiable Optimization: Subgradient Optimization Methods
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_451openalex-snapshot
Nondifferentiable Optimization: Subgradient Optimization Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_451-1openalex-snapshot
Nondifferentiable Optimization: Subgradient Optimization Methods
inferred← citeshttps://doi.org/10.1007/978-3-031-91357-0_16openalex-snapshot
Unified Presentation of the Generalized Ellipsoid Method
inferred← citeshttps://doi.org/10.1007/978-3-642-82450-0_12openalex-snapshot
Nondifferentiable Optimization
inferred← citeshttps://doi.org/10.1007/978-3-662-12273-0_9openalex-snapshot
Ellipsoid Algorithms
inferred← citeshttps://doi.org/10.1007/bf00934744openalex-snapshot
On a space extension algorithm for nondifferentiable optimization
inferred← citeshttps://doi.org/10.1007/bf01069138openalex-snapshot
Solution of minimax problems by the method of generalized gradient descent with dilatation of the space
inferred← citeshttps://doi.org/10.1007/bf01581028openalex-snapshot
On the non-polynomiality of the relaxation method for systems of linear inequalities
inferred← citeshttps://doi.org/10.1007/bf01582060openalex-snapshot
A deep cut ellipsoid algorithm for convex programming: Theory and applications
inferred← citeshttps://doi.org/10.1007/bf01583776openalex-snapshot
Modifications and implementation of the ellipsoid algorithm for linear programming
inferred← citeshttps://doi.org/10.1007/bf01584235openalex-snapshot
Polynomial algorithms for a class of linear programs
inferred← citeshttps://doi.org/10.1007/bf01584320openalex-snapshot
Optimization of lipschitz continuous functions
inferred← citeshttps://doi.org/10.1007/bf01720281openalex-snapshot
The ellipsoid method and its implications
inferred← citeshttps://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/bf02591897openalex-snapshot
The sphere method and the robustness of the ellipsoid algorithm
inferred← citeshttps://doi.org/10.1007/bf03023055openalex-snapshot
A new linear programming algorithm — better or worse than the Simplex Method?
inferred← citeshttps://doi.org/10.1007/bfb0000037openalex-snapshot
Optimality conditions in nonlinear programming
inferred← citeshttps://doi.org/10.1007/bfb0120703openalex-snapshot
A method of conjugate subgradients for minimizing nondifferentiable functions
inferred← citeshttps://doi.org/10.1007/bfb0120921openalex-snapshot
Khachiyan’s algorithm for linear programming
inferred← citeshttps://doi.org/10.1007/s10479-019-03186-2openalex-snapshot
A linear programming primer: from Fourier to Karmarkar
inferred← citeshttps://doi.org/10.1007/s10589-007-9072-6openalex-snapshot
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
inferred← citeshttps://doi.org/10.1007/s10957-015-0846-1openalex-snapshot
Implementation of Augmented Lagrangian Methods for Equilibrium Problems
inferred← citeshttps://doi.org/10.1007/s10957-024-02412-7openalex-snapshot
Polyak Minorant Method for Convex Optimization
inferred← citeshttps://doi.org/10.1016/0196-6774(80)90002-4openalex-snapshot
Khachiyan's linear programming algorithm
inferred← citeshttps://doi.org/10.1016/0377-2217(92)90080-sopenalex-snapshot
Projection algorithms for linear programming
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90271-2openalex-snapshot
The stochastic dynamic product cycling problem
inferred← citeshttps://doi.org/10.1016/b978-0-12-468662-5.50016-1openalex-snapshot
CONVERGENCE RESULTS IN A CLASS OF VARIABLE METRIC SUBGRADIENT METHODS11This research was supported in part by the D.G.E.S. (Quebec), the N.S.E.R.C. of Canada under grant A 4152, and the S.S.H.R.C. of Canada.
inferred← citeshttps://doi.org/10.1016/b978-0-12-468662-5.50021-5openalex-snapshot
POLYNOMIALLY BOUNDED ELLIPSOID ALGORITHMS FOR CONVEX QUADRATIC PROGRAMMING11Research effort partially supported by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under grant No. AFOSR 78-3646. The United States Government is authorized to reproduce and distribute…
inferred← citeshttps://doi.org/10.1016/b978-0-12-566780-7.50016-7openalex-snapshot
Geometric Methods in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50023-7openalex-snapshot
Mathematical Programming and Convex Geometry
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50032-4openalex-snapshot
10.1016/b978-044488002-4/50032-4
inferred← citeshttps://doi.org/10.1016/j.cosrev.2023.100613openalex-snapshot
A survey on algorithms for Nash equilibria in finite normal-form games
inferred← citeshttps://doi.org/10.1016/j.dss.2008.09.001openalex-snapshot
Using domain-specific knowledge in generalization error bounds for support vector machine learning
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.01.049openalex-snapshot
Fixed interval scheduling: Models, applications, computational complexity and algorithms
inferred← citeshttps://doi.org/10.1016/j.heares.2019.05.009openalex-snapshot
Cochlear pharmacokinetics - Micro-computed tomography and learning-prediction modeling for transport parameter determination
inferred← citeshttps://doi.org/10.1016/s0169-7161(05)80131-2openalex-snapshot
7 Mathematical programming — A computational perspective
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72453-8openalex-snapshot
Bounding the Independence Number of a Graph
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72943-8openalex-snapshot
Polynomial Algorithms for Perfect Graphs
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00449-xopenalex-snapshot
A Lagrangian relaxation approach to the edge-weighted clique problem
inferred← citeshttps://doi.org/10.1017/9781108755528openalex-snapshot
Foundations of Data Science
inferred← citeshttps://doi.org/10.1017/9781108755528.001openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1017/9781108755528.002openalex-snapshot
High-Dimensional Space
inferred← citeshttps://doi.org/10.1017/9781108755528.003openalex-snapshot
Best-Fit Subspaces and Singular Value Decomposition (SVD)
inferred← citeshttps://doi.org/10.1017/9781108755528.004openalex-snapshot
Random Walks and Markov Chains
inferred← citeshttps://doi.org/10.1017/9781108755528.005openalex-snapshot
Machine Learning
inferred← citeshttps://doi.org/10.1017/9781108755528.006openalex-snapshot
Algorithms for Massive Data Problems: Streaming, Sketching, and Sampling
inferred← citeshttps://doi.org/10.1017/9781108755528.007openalex-snapshot
Clustering
inferred← citeshttps://doi.org/10.1017/9781108755528.008openalex-snapshot
Random Graphs
inferred← citeshttps://doi.org/10.1017/9781108755528.009openalex-snapshot
Topic Models, Nonnegative Matrix Factorization, Hidden Markov Models, and Graphical Models
inferred← citeshttps://doi.org/10.1017/9781108755528.010openalex-snapshot
Other Topics
inferred← citeshttps://doi.org/10.1017/9781108755528.011openalex-snapshot
Wavelets
inferred← citeshttps://doi.org/10.1017/9781108755528.012openalex-snapshot
Background Material
inferred← citeshttps://doi.org/10.1017/9781108755528.013openalex-snapshot
Index
inferred← citeshttps://doi.org/10.1023/a:1011272319638openalex-snapshot
Limited Memory Space Dilation and Reduction Algorithms
inferred← citeshttps://doi.org/10.1023/a:1020215832722openalex-snapshot
inferred← citeshttps://doi.org/10.1080/07408170903542649openalex-snapshot
Multi-product lot sizing and scheduling on unrelated parallel machines
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00121openalex-snapshot
On Sharding Open Blockchains with Smart Contracts
inferred← citeshttps://doi.org/10.1109/wispnet.2016.7566550openalex-snapshot
Dual-channel speech separation by sub-segmental directional statistics
inferred← citeshttps://doi.org/10.1111/j.1467-9574.1981.tb00717.xopenalex-snapshot
The complexity of linear programming
inferred← citeshttps://doi.org/10.1201/9781420049503-c33openalex-snapshot
Integer Programming
inferred← citeshttps://doi.org/10.1201/9781584888239-c32openalex-snapshot
Convex Optimization
inferred← citeshttps://doi.org/10.1287/ijoc.1050.0158openalex-snapshot
Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability
inferred← citeshttps://doi.org/10.1287/moor.2.2.191openalex-snapshot
An Algorithm for Constrained Optimization with Semismooth Functions
inferred← citeshttps://doi.org/10.1287/opre.29.6.1039openalex-snapshot
Feature Article—The Ellipsoid Method: A Survey
inferred← citeshttps://doi.org/10.2307/2581738openalex-snapshot
Redundancy and Linear Programs
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93827openalex-snapshot
Applicability of deterministic global optimization to the short-term hydrothermal coordination problem
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.