V P Kalashnikov

Learn More
The paper develops an inexact penalty function method to solve a bi-level multi-commodity optimal tolls problem. After reducing the original problem to a single-level one by solving an auxiliary linear or quadratic programming problem, the said mathematical program's objective function is penalized and treated as an unconstrained minimization problem.(More)
The paper describes a version of the inexact Newton algorithm to solve nonlinear complementarity problems(NCP). New classes of NCP are specified for which the inexact Newton method globally converges at the superlinear rate. Moreover, an inner step accuracy control technique is developed and applied to the inexact Newton method to optimize the total(More)