• DML-CZ Home

90C06 Large-scale problems (11 articles)

• Klimeš, Lubomír; Popela, Pavel; Mauder, Tomáš; Štětina, Josef; Charvát, Pavel: Two-stage stochastic programming approach to a PDE-constrained steel production problem with the moving interface. (English). Kybernetika, vol. 53 (2017), issue 6, pp. 1047-1070
• Vlček, Jan; Lukšan, Ladislav: A modified limited-memory BNS method for unconstrained minimization derived from the conjugate directions idea. (English). In: Chleboun, J., Přikryl, P., Segeth, K., Šístek, J. and Vejchodský, T. (eds.): Programs and Algorithms of Numerical Mathematics. Proceedings of Seminar. Dolní Maxov, June 8-13, 2014. Institute of Mathematics AS CR, Prague, 2015. pp. 237-243
• Andrášik, Richard: Nonlinear Rescaling Method and Self-concordant Functions. (English). Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica, vol. 52 (2013), issue 2, pp. 5-19
• Lukšan, Ladislav; Vlček, Jan: Recursive form of general limited memory variable metric methods. (English). Kybernetika, vol. 49 (2013), issue 2, pp. 224-235
• Sun, Li; He, Guoping; Wang, Yongli; Zhou, Changyin: An accurate active set Newton algorithm for large scale bound constrained optimization. (English). Applications of Mathematics, vol. 56 (2011), issue 3, pp. 297-314
• Sun, Li; Fang, Liang; He, Guoping: An active set strategy based on the multiplier function or the gradient. (English). Applications of Mathematics, vol. 55 (2010), issue 4, pp. 291-304
• Lukšan, Ladislav; Matonoha, Ctirad; Vlček, Jan: Primal interior point method for minimization of generalized minimax functions. (English). Kybernetika, vol. 46 (2010), issue 4, pp. 697-721
• Lukšan, Ladislav; Matonoha, Ctirad; Vlček, Jan: Primal interior-point method for large sparse minimax optimization. (English). Kybernetika, vol. 45 (2009), issue 5, pp. 841-864
• Lukšan, Ladislav; Matonoha, Ctirad; Vlček, Jan: On Lagrange multipliers of trust-region subproblems. (English). In: Chleboun, J., Přikryl, P., Segeth, K. and Vejchodský, T. (eds.): Programs and Algorithms of Numerical Mathematics. Proceedings of Seminar. Dolní Maxov, June 1-6, 2008. Institute of Mathematics AS CR, Prague, 2008. pp. 130-137
• Knobloch, Matthias: Solving convex program via Lagrangian decomposition. (English). Kybernetika, vol. 40 (2004), issue 5, pp. [595]-610
• Tůma, Miroslav: A quadratic programming algorithm for large and sparse problems. (English). Kybernetika, vol. 27 (1991), issue 2, pp. 155-167