On the public citation graph

Proximal minimizations with D-functions and the massively parallel solution of linear network programs

https://doi.org/10.1007/bf00248763
0 signed · 52 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-3-642-46631-1_11openalex-snapshot
Serial and Parallel Solution of Large Scale Linear Programs by Augmented Lagrangian Successive Overrelaxation
inferredcites →https://doi.org/10.1007/bf00934676openalex-snapshot
An iterative row-action method for interval convex programming
inferredcites →https://doi.org/10.1007/bf00939565openalex-snapshot
Implementing proximal point methods for linear programming
inferredcites →https://doi.org/10.1007/bf00940051openalex-snapshot
Proximal minimization algorithm withD-functions
inferredcites →https://doi.org/10.1007/bf01589408openalex-snapshot
Parallel application of block-iterative methods in medical imaging and radiation therapy
inferredcites →https://doi.org/10.1007/bf02186478openalex-snapshot
Nonlinear network optimization on a massively parallel connection machine
inferredcites →https://doi.org/10.1016/0167-8191(88)90004-xopenalex-snapshot
A distributed algorithm for convex network optimization problems
inferredcites →https://doi.org/10.1016/b978-0-08-040806-4.50008-3openalex-snapshot
NAVAL PERSONNEL ASSIGNMENT: AN APPLICATION OF LINEAR-QUADRATIC PENALTY METHODS
inferredcites →https://doi.org/10.1016/s1474-6670(17)55135-6openalex-snapshot
Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems
inferredcites →https://doi.org/10.1109/cdc.1986.267433openalex-snapshot
Distributed relaxation methods for linear network flow problems
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0317052openalex-snapshot
Nonlinear Perturbation of Linear Programs
inferredcites →https://doi.org/10.1137/0325006openalex-snapshot
Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
inferredcites →https://doi.org/10.1137/0325067openalex-snapshot
Relaxation Methods for Network Flow Problems with Convex Arc Costs
inferredcites →https://doi.org/10.1137/0331038openalex-snapshot
Interior Dual Least 2-Norm Algorithm for Linear Programs
inferredcites →https://doi.org/10.1137/0801024openalex-snapshot
Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
inferredcites →https://doi.org/10.1137/0801035openalex-snapshot
An Interior Point Method for Block Angular Optimization
inferredcites →https://doi.org/10.1137/0801038openalex-snapshot
On the Fine-Grain Decomposition of Multicommodity Transportation Problems
inferredcites →https://doi.org/10.1287/ijoc.4.2.166openalex-snapshot
Massively Parallel Algorithms for Singly Constrained Convex Programs
inferredcites →https://doi.org/10.1287/ijoc.4.3.235openalex-snapshot
Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
inferredcites →https://doi.org/10.1287/ijoc.5.1.84openalex-snapshot
The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
inferredcites →https://doi.org/10.1287/mnsc.20.5.814openalex-snapshot
NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
inferredcites →https://doi.org/10.1287/moor.1.2.97openalex-snapshot
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
inferredcites →https://doi.org/10.1287/moor.18.1.202openalex-snapshot
Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
inferredcites →https://doi.org/10.1287/opre.38.2.240openalex-snapshot
An Empirical Evaluation of the KORBX® Algorithms for Military Airlift Applications
inferredcites →https://doi.org/10.1287/opre.41.2.319openalex-snapshot
A Massively Parallel Algorithm for Nonlinear Stochastic Network Problems
inferredcites →https://doi.org/10.4064/-24-1-145-163openalex-snapshot
On iterative methods for linearly constrained entropy maximization

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-306-48332-7_497openalex-snapshot
Stochastic Network Problems: Massively Parallel Solution
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_653openalex-snapshot
Stochastic Network Problems: Massively Parallel Solution
inferred← citeshttps://doi.org/10.1007/978-1-4615-6103-3_12openalex-snapshot
Stochastic Programming and Robust Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-91668-2_6openalex-snapshot
Losses in Transportation—Importance and Methods of Handling
inferred← citeshttps://doi.org/10.1007/bf00940051openalex-snapshot
Proximal minimization algorithm withD-functions
inferred← citeshttps://doi.org/10.1007/bf01299446openalex-snapshot
Data parallel computing for network-structured optimization problems
inferred← citeshttps://doi.org/10.1007/bf02592213openalex-snapshot
Solving multistage stochastic network programs on massively parallel computers
inferred← citeshttps://doi.org/10.1007/bf02680553openalex-snapshot
Approximate iterations in Bregman-function-based proximal algorithms
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90016-zopenalex-snapshot
Data structures for network algorithms on massively parallel architectures
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90060-4openalex-snapshot
Data-level parallel solution of min-cost network flow problems using ϵ-relaxations
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00044-6openalex-snapshot
Scalable parallel Benders decomposition for stochastic linear programming
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80122-7openalex-snapshot
Chapter 5 Parallel computing in network optimization
inferred← citeshttps://doi.org/10.1023/a:1008647026576openalex-snapshot
A Subtree-Partitioning Algorithm for Inducing Parallelism in Network Simplex Dual Updates
inferred← citeshttps://doi.org/10.1023/a:1008770914218openalex-snapshot
Bregman Proximal Relaxation of Large-Scale 0–1 Problems
inferred← citeshttps://doi.org/10.1023/a:1018977102079openalex-snapshot
Scalable parallel computations forlarge-scale stochastic programming
inferred← citeshttps://doi.org/10.1080/02331939508844144openalex-snapshot
Interval underrelaxed bregman's method with an application
inferred← citeshttps://doi.org/10.1080/10637199308915446openalex-snapshot
A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗
inferred← citeshttps://doi.org/10.1088/0266-5611/17/4/311openalex-snapshot
Convexity for the diffuse tomography model
inferred← citeshttps://doi.org/10.1137/s0363012995281742openalex-snapshot
Proximal Minimization Methods with Generalized Bregman Functions
inferred← citeshttps://doi.org/10.1145/198429.198439openalex-snapshot
A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows
inferred← citeshttps://doi.org/10.1177/109434209300700405openalex-snapshot
Massively Parallel Proximal Algorithms for Solving Linear Stochastic Network Programs
inferred← citeshttps://doi.org/10.1287/moor.22.2.326openalex-snapshot
Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
inferred← citeshttps://doi.org/10.1287/opre.41.2.319openalex-snapshot
A Massively Parallel Algorithm for Nonlinear Stochastic Network Problems
inferred← citeshttps://doi.org/10.1287/opre.42.1.65openalex-snapshot
Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
inferred← citeshttps://doi.org/10.15807/jorsj.39.407openalex-snapshot
A BLOCK-PARALLEL CONJUGATE GRADIENT METHOD FOR SEPARABLE QUADRATIC PROGRAMMING PROBLEMS^1
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.