The demand adjustment problem via inexact restoration method

DOI10.1007/s40314-020-01189-5zbMath1463.90042arXiv1807.01213OpenAlexW3040979342WikidataQ113105479 ScholiaQ113105479MaRDI QIDQ2196267

Jorgelina Walpen, Elina M. Mancinelli, Pablo A. Lotito, Lisandro A. Parente

Publication date: 28 August 2020

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

Full work available at URL: https://arxiv.org/abs/1807.01213

zbMATH Keywords

trafficbilevel problemorigin-destination matrix adjustmentinexact restoration method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Traffic problems in operations research (90B20)

Related Items (3)

Inexact restoration for derivative-free expensive function minimization and applications ⋮ Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints ⋮ Traffic sensor location using Wardrop equilibrium

Uses Software

• CiudadSim

Cites Work

• Unnamed Item
• Unnamed Item
• Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
• Solution of a truss topology bilevel programming problem by means of an inexact restoration method
• Lifting mathematical programs with complementarity constraints
• An inexact-restoration method for nonlinear bilevel programming problems
• Approximation of the steepest descent direction for the O-D matrix adjustment problem
• Two-phase model algorithm with global convergence for nonlinear programming
• A practical optimality condition without constraint qualifications for nonlinear programming
• Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions.
• On the convergence of descent methods for monotone variational inequalities
• Inexact-restoration algorithm for constrained optimization
• A heuristic for the OD matrix adjustment problem in a congested transport network
• Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
• Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.

This page was built for publication: The demand adjustment problem via inexact restoration method