Restricted simplicial decomposition: Computation and extensions

DOI10.1007/BFB0121181zbMath0636.90027MaRDI QIDQ3777773

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

Publication date: 1987

Published in: Mathematical Programming Studies (Search for Journal in Brave)

zbMATH Keywords

traffic assignmentnetwork flowFrank-Wolfe algorithmlarge-scale pseudoconvex programmingRestricted simplicial decomposition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Deterministic network models in operations research (90B10) Decomposition methods (49M27)

Related Items (37)

Decomposition techniques for the minimum toll revenue problem ⋮ Restricted simplicial decomposition for convex constrained problems ⋮ Application of the dual active set algorithm to quadratic network optimization ⋮ Computational development of a lagrangian dual approach for quadratic networks ⋮ Finite method for a nonlinear allocation problem ⋮ Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem ⋮ Solving nonlinear multicommodity flow problems by the analytic center cutting plane method ⋮ Dynamic traffic assignment: Considerations on some deterministic modelling approaches ⋮ A survey of some mathematical programming models in transportation ⋮ Approximation of the steepest descent direction for the O-D matrix adjustment problem ⋮ A heuristic method for the minimum toll booth problem ⋮ Column generation algorithms for nonlinear optimization. II: Numerical investigations ⋮ A smooth penalty function algorithm for network-structured problems ⋮ An oracle-based framework for robust combinatorial optimization ⋮ Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. ⋮ New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks ⋮ Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions. ⋮ Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints ⋮ D-optimal design of a monitoring network for parameter estimation of distributed systems ⋮ Restricted simplicial decomposition with side constraints ⋮ Conditional gradient algorithms for norm-regularized smooth convex optimization ⋮ A dual scheme for traffic assignment problems ⋮ A convergent decomposition algorithm for support vector machines ⋮ A partial linearization method for the traffic assignment problem ⋮ Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints ⋮ An Optimal Scanning Sensor Activation Policy for Parameter Estimation of Distributed Systems ⋮ Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis ⋮ Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems ⋮ A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs ⋮ An augmented Lagrangian decomposition method for block diagonal linear programming problems ⋮ Postoptimizing equilibrium flows on large scale networks ⋮ A Derivative-Free Method for Structured Optimization Problems ⋮ Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems ⋮ Fuzzy shortest paths ⋮ Finiteness in restricted simplicial decomposition ⋮ Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications ⋮ A unified description of iterative algorithms for traffic equilibria

Uses Software

• NPSOL
• NLPQL

This page was built for publication: Restricted simplicial decomposition: Computation and extensions