On the public citation graph
Relaxation methods for problems with strictly convex separable costs and linear constraints
0 signed · 63 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00934779openalex-snapshot
On the convergence of sequential minimization algorithms
inferredcites →https://doi.org/10.1007/bf01584660openalex-snapshot
On search directions for minimization algorithms
inferredcites →https://doi.org/10.1007/bfb0120964openalex-snapshot
On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
inferredcites →https://doi.org/10.1109/tac.1974.1100535openalex-snapshot
Introduction to linear and nonlinear programming
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.1287/mnsc.16.9.642openalex-snapshot
Note—A Note on the Cyclic Coordinate Ascent Method
inferredcites →https://doi.org/10.1287/moor.12.4.569openalex-snapshot
Relaxation Methods for Linear Programs
inferredcites →https://doi.org/10.2307/1909424openalex-snapshot
Nonlinear Programming: A Unified Approach
inferredcites →https://doi.org/10.2307/2005111openalex-snapshot
Computational Methods in Optimization: A Unified Approach
inferredcites →https://doi.org/10.2307/2343701openalex-snapshot
Nonlinear Programming: A Unified Approach.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/bimj.202200122openalex-snapshot
Causal effect estimation for multivariate continuous treatments
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0124openalex-snapshot
Asynchronous Iterative Algorithms with Flexible Communication for Nonlinear Network Flow Problems
inferred← citeshttps://doi.org/10.1007/978-981-95-3125-7_1openalex-snapshot
Causal Inference for a Discrete Treatment
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/bf00940050openalex-snapshot
Asymptotic properties of the fenchel dual functional and applications to decomposition problems
inferred← citeshttps://doi.org/10.1007/bf00941397openalex-snapshot
Descent methods for convex essentially smooth minimization
inferred← citeshttps://doi.org/10.1007/bf01581245openalex-snapshot
Dual coordinate ascent methods for non-strictly convex minimization
inferred← citeshttps://doi.org/10.1007/bf01582253openalex-snapshot
Matrix scaling, entropy minimization, and conjugate duality (II): The dual problem
inferred← citeshttps://doi.org/10.1007/bf01585734openalex-snapshot
Relaxation methods for monotropic programs
inferred← citeshttps://doi.org/10.1007/bf01589408openalex-snapshot
Parallel application of block-iterative methods in medical imaging and radiation therapy
inferred← citeshttps://doi.org/10.1007/bf02204860openalex-snapshot
Applying the progressive hedging algorithm to stochastic generalized networks
inferred← citeshttps://doi.org/10.1007/bf02288322openalex-snapshot
The relax codes for linear minimum cost network flow problems
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/bf02683333openalex-snapshot
Hilbertian Convex Feasibility Problem: Convergence of Projection Methods
inferred← citeshttps://doi.org/10.1007/s00245-011-9139-8openalex-snapshot
Finite Convergence of a Subgradient Projections Method with Expanding Controls
inferred← citeshttps://doi.org/10.1007/s002459900090openalex-snapshot
Relaxation Methods for Strictly Convex Regularizations of Piecewise Linear Programs
inferred← citeshttps://doi.org/10.1007/s10107-016-1034-2openalex-snapshot
On the linear convergence of the alternating direction method of multipliers
inferred← citeshttps://doi.org/10.1007/s10107-020-01599-7openalex-snapshot
Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
inferred← citeshttps://doi.org/10.1007/s10957-022-02028-9openalex-snapshot
Strong Convergence of Alternating Projections
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90183-nopenalex-snapshot
PERT and crashing revisited: Mathematical generalizations
inferred← citeshttps://doi.org/10.1016/j.comnet.2007.08.006openalex-snapshot
Spare capacity provisioning for quasi-static traffic
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.12.006openalex-snapshot
A survey on the continuous nonlinear resource allocation problem
inferred← citeshttps://doi.org/10.1016/j.jmva.2019.02.003openalex-snapshot
Calibration Estimation of Semiparametric Copula Models with Data Missing at Random
inferred← citeshttps://doi.org/10.1016/s1076-5670(08)70157-5openalex-snapshot
The Convex Feasibility Problem in Image Recovery
inferred← citeshttps://doi.org/10.1080/02533839.1995.9677704openalex-snapshot
New solution algorithms for asymmetric traffic assignment model
inferred← citeshttps://doi.org/10.1093/biomet/asz050openalex-snapshot
Minimal dispersion approximately balancing weights: asymptotic properties and practical considerations
inferred← citeshttps://doi.org/10.1109/broadnets.2006.4374369openalex-snapshot
Spare Capacity Provisioning for Dynamic Traffic Grooming in Optical Networks
inferred← citeshttps://doi.org/10.1109/tns.2004.829789openalex-snapshot
Improved iterative algorithm for sparse object reconstruction and its performance evaluation with micro-CT data
inferred← citeshttps://doi.org/10.1111/rssb.12129openalex-snapshot
Globally Efficient Non-Parametric Inference of Average Treatment Effects by Empirical Balancing Calibration Weighting
inferred← citeshttps://doi.org/10.1137/0328011openalex-snapshot
Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
inferred← citeshttps://doi.org/10.1137/0330025openalex-snapshot
On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
inferred← citeshttps://doi.org/10.1137/0802021openalex-snapshot
On the Convergence of the Products of Firmly Nonexpansive Mappings
inferred← citeshttps://doi.org/10.1137/0803034openalex-snapshot
Convex Functions with Unbounded Level Sets and Applications to Duality Theory
inferred← citeshttps://doi.org/10.1137/21m140376xopenalex-snapshot
Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity
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.1287/moor.16.3.462openalex-snapshot
Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
inferred← citeshttps://doi.org/10.1287/moor.18.4.846openalex-snapshot
On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
inferred← citeshttps://doi.org/10.1287/moor.21.4.769openalex-snapshot
Noncoercive Optimization Problems
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.2023.0596openalex-snapshot
On Sinkhorn’s Algorithm and Choice Modeling
inferred← citeshttps://doi.org/10.1287/opre.36.1.93openalex-snapshot
Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
inferred← citeshttps://doi.org/10.1287/opre.38.3.439openalex-snapshot
A Comparative Study of Algorithms for Matrix Balancing
inferred← citeshttps://doi.org/10.15807/jorsj.34.263openalex-snapshot
DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
inferred← citeshttps://doi.org/10.15807/jorsj.37.297openalex-snapshot
PRIMAL-DUAL PROXIMAL POINT ALGORITHM FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
inferred← citeshttps://doi.org/10.21236/ada458804openalex-snapshot
Successive Projection under a Quasi-Cyclic Order
inferred← citeshttps://doi.org/10.48550/arxiv.1006.2899openalex-snapshot
Approximated Structured Prediction for Learning Large Scale Graphical Models
inferred← citeshttps://doi.org/10.48550/arxiv.1210.2346openalex-snapshot
Blending Learning and Inference in Structured Prediction
inferred← citeshttps://doi.org/10.48550/arxiv.1601.03501openalex-snapshot
Efficient nonparametric estimation of causal mediation effects
inferred← citeshttps://doi.org/10.48550/arxiv.1807.05678openalex-snapshot
A Simple and Efficient Estimation of the Average Treatment Effect in the Presence of Unmeasured Confounders
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.