• DML-CZ Home

90C51 Interior-point methods (17 articles)

• Guerdouh, Safa; Chikouche, Wided; Touil, Imene; Yassine, Adnan: Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions. (English). Kybernetika, vol. 59 (2023), issue 6, pp. 827-860
• Daili, Chafia; Achache, Mohamed: An interior-point algorithm for semidefinite least-squares problems. (English). Applications of Mathematics, vol. 67 (2022), issue 3, pp. 371-391
• Ayache, Benhadid; Khaled, Saoudi: A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound. (English). Communications in Mathematics, vol. 28 (2020), issue 1, pp. 27-41
• Kheirfam, Behrouz; Mahdavi-Amiri, Nezam: New complexity analysis of a full Nesterov- Todd step infeasible interior-point algorithm for symmetric optimization. (English). Kybernetika, vol. 49 (2013), issue 6, pp. 883-896
• 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
• Ketabchi, Saeed; Moosaei, Hossein: Computing minimum norm solution of a specific constrained convex nonlinear problem. (English). Kybernetika, vol. 48 (2012), issue 1, pp. 123-129
• Mansouri, Hossein: Full-Newton step infeasible interior-point algorithm for SDO problems. (English). Kybernetika, vol. 48 (2012), issue 5, pp. 907-923
• Salahi, Maziar: An adaptive long step interior point algorithm for linear optimization. (English). Kybernetika, vol. 46 (2010), issue 4, pp. 722-729
• López, Julio; Ramírez C., Héctor: On the central paths and Cauchy trajectories in semidefinite programming. (English). Kybernetika, vol. 46 (2010), issue 3, pp. 524-535
• 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
• Fang, Liang; He, Guoping; Sun, Li: A globally convergent non-interior point algorithm with full Newton step for second-order cone programming. (English). Applications of Mathematics, vol. 54 (2009), issue 5, pp. 447-464
• 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
• Yu, Zhensheng; Li, Qiang: A self-adaptive trust region method for the extended linear complementarity problems. (English). Applications of Mathematics, vol. 54 (2009), issue 1, pp. 53-65
• Kučera, Radek; Machalová, Jitka; Ženčák, Pavel: Interior point algorithms for 3D contact problems. (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. 111-117
• 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
• Lukšan, Ladislav; Matonoha, Ctirad; Vlček, Jan: Primal interior point method for generalized minimax functions. (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. 138-149
• Allonso, Sira Allende; Guddat, Jürgen; Nowack, Dieter: A modified standard embedding for linear complementarity problems. (English). Kybernetika, vol. 40 (2004), issue 5, pp. [551]-570