On the public citation graph

A parallel descent algorithm for convex programming

https://doi.org/10.1007/bf00429749
0 signed · 39 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.1002/9781118723203openalex-snapshot
Practical Methods of Optimization
inferredcites →https://doi.org/10.1007/978-1-4613-3632-7_7openalex-snapshot
Some Reformulations and Applications of the Alternating Direction Method of Multipliers
inferredcites →https://doi.org/10.1007/bf00934554openalex-snapshot
Auxiliary problem principle and decomposition of optimization problems
inferredcites →https://doi.org/10.1007/bf00935173openalex-snapshot
A minimization method for the sum of a convex function and a continuously differentiable function
inferredcites →https://doi.org/10.1007/bf00940570openalex-snapshot
A method for minimizing the sum of a convex function and a continuously differentiable function
inferredcites →https://doi.org/10.1007/bf01581204openalex-snapshot
On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators
inferredcites →https://doi.org/10.1007/bf01581245openalex-snapshot
Dual coordinate ascent methods for non-strictly convex minimization
inferredcites →https://doi.org/10.1007/bf02186478openalex-snapshot
Nonlinear network optimization on a massively parallel connection machine
inferredcites →https://doi.org/10.1007/bf03167197openalex-snapshot
Successive linearization methods for large-scale nonlinear programming problems
inferredcites →https://doi.org/10.1016/0378-4754(88)90129-2openalex-snapshot
Practical methods of optimization
inferredcites →https://doi.org/10.1080/00207728108963798openalex-snapshot
A generalized proximal point algorithm for certain non-convex minimization problems
inferredcites →https://doi.org/10.1109/tac.1976.1101194openalex-snapshot
On the Goldstein-Levitin-Polyak gradient projection method
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0326019openalex-snapshot
A Parallel Algorithm for a Class of Convex Programs
inferredcites →https://doi.org/10.1137/0328011openalex-snapshot
Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
inferredcites →https://doi.org/10.1137/0329006openalex-snapshot
Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
inferredcites →https://doi.org/10.1137/0329045openalex-snapshot
A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
inferredcites →https://doi.org/10.1137/0801024openalex-snapshot
Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
inferredcites →https://doi.org/10.1137/0803034openalex-snapshot
Convex Functions with Unbounded Level Sets and Applications to Duality Theory
inferredcites →https://doi.org/10.1287/ijoc.1.1.20openalex-snapshot
Parallel Numerical Optimization: Current Status and an Annotated Bibliography
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.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.14.2.237openalex-snapshot
A Decomposition Method and Its Application to Convex Programming
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.2307/2008742openalex-snapshot
Practical Methods of 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/bf02614308openalex-snapshot
How to deal with the unbounded in optimization: Theory and algorithms
inferred← citeshttps://doi.org/10.1007/s10589-012-9515-6openalex-snapshot
Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
inferred← citeshttps://doi.org/10.1007/s10915-023-02101-zopenalex-snapshot
Linearly-Convergent FISTA Variant for Composite Optimization with Duality
inferred← citeshttps://doi.org/10.1023/a:1008731209637openalex-snapshot
Parallel Synchronous and Asynchronous Space-Decomposition Algorithms for Large-Scale Minimization Problems
inferred← citeshttps://doi.org/10.1023/a:1022646327085openalex-snapshot
Convergence Analysis and Applications of the Glowinski–Le Tallec Splitting Method for Finding a Zero of the Sum of Two Maximal Monotone Operators
inferred← citeshttps://doi.org/10.1137/s105262349427577xopenalex-snapshot
Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs
inferred← citeshttps://doi.org/10.1137/s1052623495279797openalex-snapshot
Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
inferred← citeshttps://doi.org/10.1137/s1052623495288064openalex-snapshot
Proximal Decomposition Via Alternating Linearization
inferred← citeshttps://doi.org/10.15807/jorsj.39.213openalex-snapshot
PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING PROBLEMS
inferred← citeshttps://doi.org/10.15807/jorsj.39.407openalex-snapshot
A BLOCK-PARALLEL CONJUGATE GRADIENT METHOD FOR SEPARABLE QUADRATIC PROGRAMMING PROBLEMS^1
inferred← citeshttps://doi.org/10.15807/jorsj.39.566openalex-snapshot
A PARALLEL PRIMAL-DUAL INTERIOR POINT METHOD FOR MULTICOMMODITY FLOW PROBLEMS WITH QUADRATIC COSTS
inferred← citeshttps://doi.org/10.48550/arxiv.1105.5427openalex-snapshot
Combining Lagrangian Decomposition and Excessive Gap Smoothing Technique for Solving Large-Scale Separable Convex Optimization Problems
inferred← citeshttps://doi.org/10.5687/iscie.10.248openalex-snapshot
An Asynchronous Block-Parallel Algorithm for Separable Quadratic Programming Problems
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.