A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem

DOI10.1007/s11075-022-01384-xOpenAlexW4292171770MaRDI QIDQ2691902

Dimitri Papadimitriou, Bằng Công Vũ

Publication date: 30 March 2023

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-022-01384-x

zbMATH Keywords

nonconvex optimizationconvex relaxationdynamic traffic assignmentnonlinear ADMM

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Related Items (1)

A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization

Uses Software

• SNDlib

Cites Work

• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A proximal method for composite minimization
• Proximity for sums of composite functions
• A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• The S-shaped utility function
• Global convergence of ADMM in nonconvex nonsmooth optimization
• A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
• A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints
• Multiplier and gradient methods
• A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Optimal Time-Varying Flows on Congested Networks
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• A primal–dual hybrid gradient method for nonlinear operators with applications to MRI
• Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence
• Optimal Flows in Stochastic Dynamic Networks with Congestion
• Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
• Global optimization of nonconvex factorable programming problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem