A smooth penalty function algorithm for network-structured problems
type: Item
instance of: scholarly article
title: A smooth penalty function algorithm for network-structured problems
zbMATH Open document ID: 0905.90065
DOI: 10.1016/0377-2217(95)90601-A
author: Stavros A. Zenios
author: Ron S. Dembo
author: Mustafa Ç. Pınar
published in: European Journal of Operational Research
publication date: 1998-10-06T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1162964
zbMATH Keywords: linear-quadratic penalty function
zbMATH Keywords: large linear multicommodity network flow
zbMATH Keywords: military planning
describes a project that uses: MINOS
describes a project that uses: KORBX
MaRDI profile type: Publication
cites work: Multicommodity network flows—A survey
cites work: Q4163968
cites work: Enlarging the region of convergence of Newton's method for constrained optimization
cites work: Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
cites work: A primal truncated newton algorithm with application to large-scale nonlinear network optimization
cites work: A scaled reduced gradient algorithm for network flow problems with convex separable costs
cites work: Dealing with degeneracy in reduced gradient algorithms
cites work: OR Practice—Large-Scale Nonlinear Network Models and Their Application
cites work: Q5588268
cites work: A network penalty method
cites work: Q4739659
cites work: Restricted simplicial decomposition: Computation and extensions
cites work: An extension of the frank and Wolfe method of feasible directions
cites work: A new polynomial-time algorithm for linear programming
cites work: A Survey of Linear Cost Multicommodity Network Flows
cites work: Q4039997
cites work: Solving multistage stochastic networks: An application of scenario aggregation
cites work: Simplicial Decomposition for Convex Generalized Networks
cites work: A Massively Parallel Algorithm for Nonlinear Stochastic Network Problems
cites work: A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows
cites work: Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
cites work: An augmented Lagrangian decomposition method for block diagonal linear programming problems
cites work: Interior dual proximal point algorithm using preconditioned conjugate gradient †
cites work: An Interior Point Method for Block Angular Optimization
cites work: Simplicial decomposition in nonlinear programming algorithms
cites work: Discontinuous Optimization by Smoothing
cites work: Parallel Block-Partitioning of Truncated Newton for Nonlinear Network Optimization
full work available at URL: 0377-2217(95)90601-a
OpenAlex ID: W2007549096
description: scientific article; zbMATH DE number 1162964