A diagonal quadratic approximation method for large scale linear programs

DOI10.1016/0167-6377(92)90046-6zbMath0767.90047OpenAlexW1973615364MaRDI QIDQ1200793

John M. Mulvey, Ruszczyński, Andrzej

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90046-6

zbMATH Keywords

augmented Lagrangian methodconvex separable programsaugmented Lagrangianlinking constraintsdiagonal quadratic approximationmulticommodity networksblock- diagonal structurelarge scale linear programmingnonlinear primal-dual barrier method

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Stochastic programming (90C15) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming, Network planning under uncertainty with an application to hydropower generation, Decomposition Methods Based on Augmented Lagrangians: A Survey, On augmented Lagrangian decomposition methods for multistage stochastic programs, Solving multistage stochastic network programs on massively prallel computers, On solving stochastic production planning problems via scenario modelling, On the enrouting protocol problem under uncertainty, Partitioning mathematical programs for parallel solution, CORO, a modeling and an algorithmic framework for oil supply, transformation and distribution optimization under uncertainty, Separable approximations and decomposition methods for the augmented Lagrangian, A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems, A review of decentralized optimization focused on information flows of decomposition algorithms, Modified Lagrangian methods for separable optimization problems, Convergence of the augmented decomposition algorithm, An augmented Lagrangian method for distributed optimization, Total allowable catch for managing squat lobster fishery using stochastic nonlinear programming, Combining stochastic programming and optimal control to decompose multistage stochastic optimization problems, A scenario-based stochastic programming approach for technology and capacity planning, Schumann, a modeling framework for supply chain management under uncertainty, Convergent cutting-plane and partial-sampling algorithm for multistage stochastic linear programs with recourse, A variable-penalty alternating directions method for convex optimization, Alternating direction splittings for block angular parallel optimization, Accelerating techniques on nested decomposition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational experience with a primal-dual interior point method for linear programming
• Applying the progressive hedging algorithm to stochastic generalized networks
• Enlarging the region of convergence of Newton's method for constrained optimization
• New dual-type decomposition algorithm for non-convex separable optimization problems
• The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
• An augmented Lagrangian decomposition method for block diagonal linear programming problems
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• Further Development of a Primal-Dual Interior Point Method
• Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure