Finiteness in restricted simplicial decomposition

DOI10.1016/0167-6377(85)90016-1zbMath0582.90078OpenAlexW2057942895MaRDI QIDQ1069859

José A. Ventura, Siriphong Lawphongpanich, Donald W. Hearn

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0167-6377(85)90016-1

zbMATH Keywords

linear constraintslarge scale optimizationsimplicial decomposition

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of successive quadratic programming type (90C55)

Related Items (15)

The convergence conditions of diagonalization and projection methods for fixed demand asymmetric network equilibrium problems ⋮ Restricted simplicial decomposition for convex constrained problems ⋮ A framework for and empirical study of algorithms for traffic assignment ⋮ A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems ⋮ Bilevel programming in traffic planning: Models, methods and challenge ⋮ A conjugate gradient projection algorithm for the traffic assignment problem ⋮ Column generation algorithms for nonlinear optimization. II: Numerical investigations ⋮ Analysis of relaxations for the multi-item capacitated lot-sizing problem ⋮ D-optimal design of a monitoring network for parameter estimation of distributed systems ⋮ An Optimal Scanning Sensor Activation Policy for Parameter Estimation of Distributed Systems ⋮ A scenario-based stochastic programming approach for technology and capacity planning ⋮ Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis ⋮ Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems ⋮ A modified \textit{Physarum}-inspired model for the user equilibrium traffic assignment problem ⋮ Sensor network scheduling for identification of spatially distributed processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Restricted simplicial decomposition: Computation and extensions
• Optimal Routing in a Packet-Switched Computer Network
• A finite algorithm to maximize certain pseudoconcave functions on polytopes
• Simplicial decomposition in nonlinear programming algorithms
• Projected Newton Methods for Optimization Problems with Simple Constraints
• An extension of the frank and Wolfe method of feasible directions
• A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
• Elements of Large-Scale Mathematical Programming Part I: Concepts

This page was built for publication: Finiteness in restricted simplicial decomposition