Reduction of a Minimization Problem of a Separable Convex Function Under Linear Constraints to a Fixed Point Problem

DOI10.1134/S199047891801009XzbMath1413.90262OpenAlexW2791908332WikidataQ130150826 ScholiaQ130150826MaRDI QIDQ4553644

Alexander Krylatov

Publication date: 30 October 2018

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s199047891801009x

zbMATH Keywords

constrained nonlinear optimizationfixed point problemnetwork flow assignmentgeneralized projection matrix

Mathematics Subject Classification ID

Nonlinear programming (90C30) Deterministic network models in operations research (90B10)

Related Items (3)

A Computational Approach to Estimating Activity Coefficients Using Gibbs Energy Minimization ⋮ Column generation for the equilibrium route-flow traffic assignment problem ⋮ Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network

Cites Work

• Parallel optimization for traffic assignment
• A unified description of iterative algorithms for traffic equilibria
• Network flow assignment as a fixed point problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reduction of a Minimization Problem of a Separable Convex Function Under Linear Constraints to a Fixed Point Problem