On the public citation graph
Application of the dual active set algorithm to quadratic network optimization
0 signed · 68 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.1002/nav.3800230403openalex-snapshot
The conjugate gradient technique for certain quadratic network problems
inferredcites →https://doi.org/10.1002/nav.3800330106openalex-snapshot
A lagrangean relaxation algorithm for the constrained matrix problem
inferredcites →https://doi.org/10.1002/net.3230130310openalex-snapshot
A Newton method for convex separable network flow problems
inferredcites →https://doi.org/10.1002/net.3230140404openalex-snapshot
Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
inferredcites →https://doi.org/10.1002/net.3230190108openalex-snapshot
Implementing an “exact” Newton method for separable convex transportation problems
inferredcites →https://doi.org/10.1002/net.3230210407openalex-snapshot
Computational development of a lagrangian dual approach for quadratic networks
inferredcites →https://doi.org/10.1007/bf00939044openalex-snapshot
Dual techniques for constrained optimization
inferredcites →https://doi.org/10.1007/bf01582254openalex-snapshot
On large scale nonlinear Network optimization
inferredcites →https://doi.org/10.1007/bf01585748openalex-snapshot
An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
inferredcites →https://doi.org/10.1007/bf01588328openalex-snapshot
A polynomially bounded algorithm for a singly constrained quadratic program
inferredcites →https://doi.org/10.1007/bf01588953openalex-snapshot
A quadratic network optimization model for equilibrium single commodity trade flows
inferredcites →https://doi.org/10.1007/bf02022089openalex-snapshot
Relaxation techniques for strictly convex network problems
inferredcites →https://doi.org/10.1007/bf02591962openalex-snapshot
A numerically stable dual method for solving strictly convex quadratic programs
inferredcites →https://doi.org/10.1007/bf03000397openalex-snapshot
Comparison of different methods for the calculation of traffic matrices
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/bfb0121016openalex-snapshot
Multipoint methods for separable nonlinear networks
inferredcites →https://doi.org/10.1007/bfb0121178openalex-snapshot
A primal truncated newton algorithm with application to large-scale nonlinear network optimization
inferredcites →https://doi.org/10.1007/bfb0121181openalex-snapshot
Restricted simplicial decomposition: Computation and extensions
inferredcites →https://doi.org/10.1016/0024-3795(80)90211-6openalex-snapshot
Minimum norm problems over transportation polytopes
inferredcites →https://doi.org/10.1016/0377-2217(84)90160-7openalex-snapshot
A polynomial algorithm for minimum quadratic cost flow problems
inferredcites →https://doi.org/10.1016/0378-4754(86)90036-4openalex-snapshot
Introduction to applied mathematics.
inferredcites →https://doi.org/10.1016/0898-1221(89)90177-6openalex-snapshot
A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6054-0openalex-snapshot
Optimal Economic Operation of Electric Power Systems
inferredcites →https://doi.org/10.1051/m2an/197004r301541openalex-snapshot
Brève communication. Régularisation d'inéquations variationnelles par approximations successives
inferredcites →https://doi.org/10.1080/01630568208816109openalex-snapshot
Submonotone mappings and the proximal point algorithm
inferredcites →https://doi.org/10.1080/02522667.1990.10699030openalex-snapshot
Simplicial Decomposition for Convex Generalized Networks
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0367131-6openalex-snapshot
Generalized Gradients and Applications
inferredcites →https://doi.org/10.1109/tac.1974.1100535openalex-snapshot
Introduction to linear and nonlinear programming
inferredcites →https://doi.org/10.1115/1.3171799openalex-snapshot
Introduction to Applied Mathematics
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0322019openalex-snapshot
Asymptotic Convergence Analysis of the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0322027openalex-snapshot
Dual Approximations in Optimal Control
inferredcites →https://doi.org/10.1137/0325006openalex-snapshot
Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
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/0328029openalex-snapshot
A Generalization of the Proximal Point Algorithm
inferredcites →https://doi.org/10.1145/356022.356025openalex-snapshot
A Reduced Gradient Algorithm for Nonlinear Network Problems
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/mnsc.24.7.747openalex-snapshot
Solving the Pipe Network Analysis Problem Using Optimization Techniques
inferredcites →https://doi.org/10.1287/mnsc.27.4.431openalex-snapshot
Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
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.19.4.445openalex-snapshot
Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.
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-3279-4_16openalex-snapshot
The LP Dual Active Set Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-59179-2_6openalex-snapshot
ɛ-Relaxation and Auction Methods for Separable Convex Cost Network Flow Problems
inferred← citeshttps://doi.org/10.1007/s10107-006-0017-0openalex-snapshot
A sparse proximal implementation of the LP dual active set algorithm
inferred← citeshttps://doi.org/10.1007/s10107-006-0022-3openalex-snapshot
Dual multilevel optimization
inferred← citeshttps://doi.org/10.1007/s10589-007-9150-9openalex-snapshot
Elliptic optimal control problems with L 1-control cost and applications for the placement of control devices
inferred← citeshttps://doi.org/10.1007/s10589-014-9681-9openalex-snapshot
A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
inferred← citeshttps://doi.org/10.1007/s10589-016-9886-1openalex-snapshot
A dual gradient-projection method for large-scale strictly convex quadratic problems
inferred← citeshttps://doi.org/10.1007/s10898-014-0186-yopenalex-snapshot
Error estimation in nonlinear optimization
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/s0169-7161(05)80131-2openalex-snapshot
7 Mathematical programming — A computational perspective
inferred← citeshttps://doi.org/10.1023/a:1013773102688openalex-snapshot
The Dual Active Set Algorithm and Its Application to Linear Programming
inferred← citeshttps://doi.org/10.1023/a:1015489608037openalex-snapshot
Primal-Dual Strategy for State-Constrained Optimal Control Problems
inferred← citeshttps://doi.org/10.1023/a:1024029423064openalex-snapshot
An Implementation of the QSPLINE Method for Solving Convex Quadratic Programming Problems With Simple Bound Constraints
inferred← citeshttps://doi.org/10.1023/a:1026047622744openalex-snapshot
Lagrange-SQP Techniques for the Control Constrained Optimal Boundary Control for the Burgers Equation
inferred← citeshttps://doi.org/10.1080/10556780410001654214openalex-snapshot
Nonlinear conjugate gradient methods for the optimal control of laser surface hardening
inferred← citeshttps://doi.org/10.1080/10556780601079266openalex-snapshot
A proximal subgradient projection algorithm for linearly constrained strictly convex problems
inferred← citeshttps://doi.org/10.1090/qam/1955227openalex-snapshot
A primal-dual active set algorithm for bilaterally control constrained optimal control problems
inferred← citeshttps://doi.org/10.1137/15m102825xopenalex-snapshot
Projection onto a Polyhedron that Exploits Sparsity
inferred← citeshttps://doi.org/10.1137/s0363012902411015openalex-snapshot
The Primal-Dual Active Set Method for Nonlinear Optimal Control Problems with Bilateral Constraints
inferred← citeshttps://doi.org/10.1137/s089547980343641xopenalex-snapshot
Row Modifications of a Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1137/s1052623494265359openalex-snapshot
Applying a Newton Method to Strictly Convex Separable Network Quadratic Programs
inferred← citeshttps://doi.org/10.1137/s1052623495285886openalex-snapshot
An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems
inferred← citeshttps://doi.org/10.1145/3583559openalex-snapshot
Algorithm 1035: A Gradient-based Implementation of the Polyhedral Active Set Algorithm
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.