Karakitsiou, AthanasiaMavrommati, AthanasiaMigdalas, Athanasios2015-06-262024-09-272015-06-262024-09-272004http://link.springer.com/article/10.1007/BF02943605https://repository2024.ihu.gr/handle/123456789/1507Many problems in portfolio selection, in traffic planning and in computer communication networks can be formulated as nonlinear problems involving minimization of a nonlinear function over simplices. Based on the concepts of regularization and partial linearization, we propose an efficient solution technique for such programs, prove its global convergence and discuss the possibilities for parallel implementation. We provide, as an application, an algorithm for traffic assignment which outperforms previous state-of-the-art codes.19enAttribution-NonCommercial-NoDerivatives 4.0 Διεθνέςhttp://creativecommons.org/licenses/by-nc-nd/4.0/Άρθρο σε επιστημονικό περιοδικό10.1007/BF02943605Network problemLinearizationSolution techniques