On the public citation graph

Decomposition algorithm for convex differentiable minimization

https://doi.org/10.1007/bf00940507
0 signed · 47 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/nav.3800060105openalex-snapshot
A convex programming procedure
inferredcites →https://doi.org/10.1007/978-0-387-74503-9openalex-snapshot
Linear and Nonlinear Programming
inferredcites →https://doi.org/10.1007/bf00934779openalex-snapshot
On the convergence of sequential minimization algorithms
inferredcites →https://doi.org/10.1007/bf00939250openalex-snapshot
More results on the convergence of iterative methods for the symmetric linear complementarity problem
inferredcites →https://doi.org/10.1007/bf01584660openalex-snapshot
On search directions for minimization algorithms
inferredcites →https://doi.org/10.1007/bf01589409openalex-snapshot
Parallel optimization for traffic assignment
inferredcites →https://doi.org/10.1007/bf02186473openalex-snapshot
Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
inferredcites →https://doi.org/10.1007/bf02591749openalex-snapshot
Asymmetric variational inequality problems over product sets: Applications and iterative methods
inferredcites →https://doi.org/10.1007/bf02591891openalex-snapshot
An iterative scheme for variational inequalities
inferredcites →https://doi.org/10.1007/bfb0120941openalex-snapshot
A scaled reduced gradient algorithm for network flow problems with convex separable costs
inferredcites →https://doi.org/10.1007/bfb0120965openalex-snapshot
Projection methods for variational inequalities with application to the traffic assignment problem
inferredcites →https://doi.org/10.1016/0041-5553(66)90114-5openalex-snapshot
Constrained minimization methods
inferredcites →https://doi.org/10.1016/0378-4754(86)90092-3openalex-snapshot
Linear and nonlinear programming.
inferredcites →https://doi.org/10.1016/c2013-0-10366-2openalex-snapshot
Constrained Optimization and Lagrange Multiplier Methods
inferredcites →https://doi.org/10.1016/s0168-2024(08)70034-1openalex-snapshot
Chapter IX Applications of the Method of Multipliers to Variational Inequalities
inferredcites →https://doi.org/10.1057/jors.1985.33openalex-snapshot
Network Flows and Monotropic Optimization.
inferredcites →https://doi.org/10.1090/s0002-9904-1964-11178-2openalex-snapshot
Convex programming in Hilbert space
inferredcites →https://doi.org/10.1109/cdc.1987.272506openalex-snapshot
A nonlinear proximal point algorithm
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0325023openalex-snapshot
Iterative Methods for Large Convex Quadratic Programs: A Survey
inferredcites →https://doi.org/10.1137/0325067openalex-snapshot
Relaxation Methods for Network Flow Problems with Convex Arc Costs
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/0602024openalex-snapshot
Equilibria on a Congested Transportation Network
inferredcites →https://doi.org/10.1137/0716071openalex-snapshot
Splitting Algorithms for the Sum of Two Nonlinear Operators
inferredcites →https://doi.org/10.1287/mnsc.34.3.411openalex-snapshot
Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization
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/trsc.14.1.42openalex-snapshot
Traffic Equilibrium and Variational Inequalities
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.2307/2343863openalex-snapshot
Nonlinear Programming.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4613-3400-2_9openalex-snapshot
Parallel Cost Approximation Algorithms for Differentiable Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-45780-7_3openalex-snapshot
Coupling the Logarithmic-Quadratic Proximal Method and the Block Nonlinear Gauss-Seidel Algorithm for Linearly Constrained Convex Minimization
inferred← citeshttps://doi.org/10.1007/bf00939948openalex-snapshot
On the convergence of the coordinate descent method for convex differentiable minimization
inferred← citeshttps://doi.org/10.1007/bf01582565openalex-snapshot
A class of gap functions for variational inequalities
inferred← citeshttps://doi.org/10.1007/s10589-007-9044-xopenalex-snapshot
A convergent decomposition algorithm for support vector machines
inferred← citeshttps://doi.org/10.1007/s43069-025-00593-zopenalex-snapshot
Block Coordinate Dinkelbach Algorithms for Solving Block-Structured Constrained Fractional Optimization Problems
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90046-popenalex-snapshot
A unified description of iterative algorithms for traffic equilibria
inferred← citeshttps://doi.org/10.1016/j.trc.2024.104843openalex-snapshot
A novel framework of the alternating direction method of multipliers with application to traffic assignment problem
inferred← citeshttps://doi.org/10.1016/s0167-6377(99)00074-7openalex-snapshot
On the convergence of the block nonlinear Gauss–Seidel method under convex constraints
inferred← citeshttps://doi.org/10.1023/a:1018358602892openalex-snapshot
Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets
inferred← citeshttps://doi.org/10.1080/0233193031000079856openalex-snapshot
Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
inferred← citeshttps://doi.org/10.1080/10556789908805730openalex-snapshot
Globally convergent block-coordinate techniques for unconstrained optimization
inferred← citeshttps://doi.org/10.1080/23249935.2020.1749961openalex-snapshot
A discrete day-to-day link flow dynamic model considering travelers’ heterogeneous inertia patterns
inferred← citeshttps://doi.org/10.1088/0266-5611/29/6/065017openalex-snapshot
A convergent blind deconvolution method for post-adaptive-optics astronomical imaging
inferred← citeshttps://doi.org/10.1093/imanum/drq024openalex-snapshot
Inexact block coordinate descent methods with application to non-negative matrix factorization
inferred← citeshttps://doi.org/10.1109/icufn.2010.5547233openalex-snapshot
Joint grouping and scheduling in complexity-constrained broadcasting ad-hoc networks
inferred← citeshttps://doi.org/10.1137/s105262349427577xopenalex-snapshot
Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs
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.