Computational development of a lagrangian dual approach for quadratic networks

DOI10.1002/net.3230210407zbMath0748.90016OpenAlexW2069958114MaRDI QIDQ3977272

José A. Ventura

Publication date: 25 June 1992

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230210407

zbMATH Keywords

Lagrangian decompositionconjugate gradientquadratic network flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, A Newton's method for the continuous quadratic knapsack problem, Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints, Computational comparisons of dual conjugate gradient algorithms for strictly convex networks., A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization, Variable fixing algorithms for the continuous quadratic Knapsack problem, A survey on the continuous nonlinear resource allocation problem, Breakpoint searching algorithms for the continuous quadratic knapsack problem, On the linear convergence of the alternating direction method of multipliers, Convergent Lagrangian heuristics for nonlinear minimum cost network flows, Simple solution methods for separable mixed linear and quadratic knapsack problem, A proximal subgradient projection algorithm for linearly constrained strictly convex problems, Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities, Variable fixing method by weighted average for the continuous quadratic knapsack problem, An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem

Cites Work

• Multipoint methods for separable nonlinear networks
• A primal truncated newton algorithm with application to large-scale nonlinear network optimization
• Restricted simplicial decomposition: Computation and extensions
• On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
• Methods of conjugate gradients for solving linear systems