A smooth penalty function algorithm for network-structured problems

DOI10.1016/0377-2217(95)90601-AzbMath0905.90065OpenAlexW2007549096MaRDI QIDQ1388940

Ron S. Dembo, Stavros A. Zenios, Mustafa Çelebi Pinar

Publication date: 6 October 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)90601-a

zbMATH Keywords

large linear multicommodity network flowlinear-quadratic penalty functionmilitary planning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Deterministic network models in operations research (90B10)

Related Items

Unnamed Item, An exact lower order penalty function and its smoothing in nonlinear programming, An efficient method for nonlinearly constrained networks

Uses Software

• KORBX
• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Enlarging the region of convergence of Newton's method for constrained optimization
• A network penalty method
• An augmented Lagrangian decomposition method for block diagonal linear programming problems
• Dealing with degeneracy in reduced gradient algorithms
• A primal truncated newton algorithm with application to large-scale nonlinear network optimization
• Restricted simplicial decomposition: Computation and extensions
• Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
• OR Practice—Large-Scale Nonlinear Network Models and Their Application
• A scaled reduced gradient algorithm for network flow problems with convex separable costs
• Discontinuous Optimization by Smoothing
• Solving multistage stochastic networks: An application of scenario aggregation
• An Interior Point Method for Block Angular Optimization
• Parallel Block-Partitioning of Truncated Newton for Nonlinear Network Optimization
• Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
• Simplicial decomposition in nonlinear programming algorithms
• A Survey of Linear Cost Multicommodity Network Flows
• Multicommodity network flows—A survey
• Interior dual proximal point algorithm using preconditioned conjugate gradient †
• A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows
• Simplicial Decomposition for Convex Generalized Networks
• An extension of the frank and Wolfe method of feasible directions
• A Massively Parallel Algorithm for Nonlinear Stochastic Network Problems