On the public citation graph

Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs

https://doi.org/10.1007/bf01581138
0 signed · 34 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-0-387-31256-9_6openalex-snapshot
Nonsmooth Optimization
inferredcites →https://doi.org/10.1007/bf01580223openalex-snapshot
Validation of subgradient optimization
inferredcites →https://doi.org/10.1007/bf01582105openalex-snapshot
A stable method for solving certain constrained least squares problems
inferredcites →https://doi.org/10.1007/bf01589355openalex-snapshot
An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf02023050openalex-snapshot
Parallel bundle-based decomposition for large-scale structured mathematical programming problems
inferredcites →https://doi.org/10.1007/bf02591904openalex-snapshot
Computational experience with advanced implementation of decomposition algorithms for linear programming
inferredcites →https://doi.org/10.1007/bfb0004506openalex-snapshot
A view of line-searches
inferredcites →https://doi.org/10.1007/bfb0043902openalex-snapshot
Bundle-based decomposition: Description and preliminary results
inferredcites →https://doi.org/10.1016/0377-2217(90)90023-5openalex-snapshot
DECOMP: an implementation of Dantzig-Wolfe decomposition for linear programming
inferredcites →https://doi.org/10.1016/b978-0-12-468662-5.50015-xopenalex-snapshot
ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATION
inferredcites →https://doi.org/10.1016/s0294-1449(17)30033-1openalex-snapshot
Bundle-Based Decomposition: Conditions for Convergence
inferredcites →https://doi.org/10.1051/ro/1984180404031openalex-snapshot
Computational aspects of DYNAMICO : a model of trade and development in the world economy
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/1.9781611970524openalex-snapshot
Conjugate Duality and Optimization
inferredcites →https://doi.org/10.1137/1.9781611970524.ch1openalex-snapshot
1. Conjugate Duality and Optimization
inferredcites →https://doi.org/10.1137/1.9781611975604openalex-snapshot
Practical Optimization
inferredcites →https://doi.org/10.1287/opre.8.1.101openalex-snapshot
Decomposition Principle for Linear Programs
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.21236/ada138522openalex-snapshot
MINOS 5.0 User's Guide.
inferredcites →https://doi.org/10.2307/2580835openalex-snapshot
Systems Analysis by Multilevel Methods; With Applications to Economics and Management
inferredcites →https://doi.org/10.2307/3439771openalex-snapshot
Systems Analysis by Multilevel Methods: With Applications to Economics and Management

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-60902-4_50openalex-snapshot
Decomposing linear programs for parallel solution
inferred← citeshttps://doi.org/10.1007/3-540-62095-8_64openalex-snapshot
An effective model to decompose Linear Programs for parallel solution
inferred← citeshttps://doi.org/10.1007/978-3-030-43736-7_2openalex-snapshot
The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-59179-2_23openalex-snapshot
Approximate Lagrangian Decomposition with a Modified Karmarkar Logarithmic Potential
inferred← citeshttps://doi.org/10.1007/bf02192181openalex-snapshot
Generalized proximal point algorithm for convex optimization
inferred← citeshttps://doi.org/10.1007/s100120200018openalex-snapshot
The Existence of Optimal Solutions for a Kind of Large-Scale Goal Proramming
inferred← citeshttps://doi.org/10.1007/s10107-016-1067-6openalex-snapshot
A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
inferred← citeshttps://doi.org/10.1016/b978-012557189-0/50024-xopenalex-snapshot
BIBLIOGRAPHY
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00350-0openalex-snapshot
Iterative bundle-based decomposition for large-scale nonseparable convex optimization
inferred← citeshttps://doi.org/10.1137/s1064827502401953openalex-snapshot
Permuting Sparse Rectangular Matrices into Block-Diagonal Form
inferred← citeshttps://doi.org/10.1287/ijoc.11.4.370openalex-snapshot
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
inferred← citeshttps://doi.org/10.1287/mnsc.46.1.126.15132openalex-snapshot
A Survey of Algorithms for Convex Multicommodity Flow Problems
inferred← citeshttps://doi.org/10.31274/etd-180810-1096openalex-snapshot
Policy driven capacity expansion planning of energy infrastructure: modeling and solutions using high performance computing
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.