Ladislav Lukšan Ústav informatiky Praha 8 Telefon: (+4202) , Fax: (+4202)

Přehled Publikační činnosti Ladislav Lukšan Ústav informatiky Akademie věd České republiky Pod vodárenskou věží 2 182 07 Praha 8 Telefon: (+4202) 66053260, Fax: (+4202) 8585789 email: luksan@cs.cas.cz Seznam publikací: 1. Lukšan L.: New Combined Method for Unconstrained Minimization. Computing, Vol.28, 1982, pp.155-169. 2. Lukšan L.: Quasi-Newton Methods without Projections for Unconstrained Minimization. Kybernetika, Vol.18, 1982, No.4, pp.290-306. 3. Lukšan L.: Quasi-Newton Methods without Projections for Linearly Constrained Minimization. Kybernetika, Vol.18, 1982, No.4, pp.307-319. 4. Lukšan L.: Variable Metric Method with Limited Storage for Large Scale Unconstrained Minimization. Kybernetika, Vol.18, 1982, No.6, pp.517-528. 5. Lukšan L.: Variable Metric Methods for Linearly Constrained Nonlinear Minimax Approximation. Computing, Vol.30, 1983, pp.315-334. 6. Lukšan L.: Dual Method for Solving a Special Problem of Quadratic Programming as a Subproblem at Linearly Constrained Nonlinear Minimax Approximation. Kybernetika 20 (1984) 445-457. 7. Lukšan L.: A Compact Variable Metric Algorithm for Linearly Constrained Nonlinear Minimax Approximation. Kybernetika, Vol.21, 1985, No.6, pp.405-427. 8. Lukšan L.: An Implementation of Recursive Quadratic Programming Variable Metric Methods for Linearly Constrained Nonlinear Minimax Approximation. Kybernetika, Vol.21, 1985, No.1, pp.22-40. 9. Lukšan L.: Variable Metric Methods for a Class of Extended Conic Functions. Kybernetika, Vol.21, 1985, No.2, pp.96-107. 10. Lukšan L.: A Compact Variable Metric Algorithm for Linear Minimax Approximation. Computing, Vol.36, 1986, pp.355-373. 11. Lukšan L.: Dual Method for Solving a Special Problem of Quadratic Programming as a Subproblem at Nonlinear Minimax Approximation. Applications of Mathematics, Vol. 31, 1986, pp.379-395. 12. Lukšan L.: Conjugate Direction Algorithms For Extended Conic Functions. Kybernetika, Vol.22, 1986, No.1, pp.31-46. 13. Lukšan L.: Conjugate Gradient Algorithms for Conic Functions. Applications of Mathematics, Vol.31, 1986, pp.427-440. 14. Lukšan L.: Metody s proměnnou metrikou. Nepodmíněná minimalizace. Academia, Praha 1990. 15. Lukšan L.: Computational Experience with Improved Variable Metric Methods for Unconstrained Minimization. Kybernetika, Vol.26, 1990, No.5, pp.415-431. 16. Lukšan L.: A Note on Comparison of Statistical Software for Nonlinear Regression. Computational Statistics Quarterly, Vol.4, 1991, pp.321-324.

17. Lukšan L.: Computational Experience with Improved Conjugate Gradient Methods for Unconstrained Minimization. Kybernetika, Vol.28, 1992, No.4, pp.249-262. 18. Lukšan L.: Variationally Derived Scaling and Variable Metric Updates from the Preconvex Part of the Broyden Family. Journal of Optimization Theory and Applications, Vol.73, 1992, No.2, pp.299-307. 19. Lukšan L.: Inexact Trust Region Method for Large Sparse Nonlinear Least Squares. Kybernetika, Vol.29, 1993, No.4, pp.305-324. 20. Lukšan L.: Inexact Trust Region Method for Large Sparse Systems of Nonlinear Equations. Journal of Optimization Theory and Applications, Vol.81, 1994, No. 3, pp.569-590. 21. Lukšan L.: Computational Experience With Known Variable Metric Updates. Journal of Optimization Theory and Applications, Vol.83, 1994, No.1, pp.27-47. 22. Lukšan L., Vlček J.: Parametrická optimalizace dynamických systémů. In: Programy a Algoritmy Numerické Matematiky 7, Bratříkov 1994, pp.128-140. 23. Lukšan L., Vlček J.: Simple Scaling for Variable Metric Updates. Technical Report V-611. Prague, ICS AS CR 1994. 24. Lukšan L., Vlček J.: An Algorithm for Large Sparse Equality Constrained Nonlinear Programming Problems. Proceedings of the 11-th Summer School on Software and Algorithms of Numerical Mathematics. Železná Ruda, 1995, pp.154-162. 25. Lukšan L.: Efficient Trust Region Method for Nonlinear Least Squares. Kybernetika Vol. 32, 1996, pp.105-120. 26. Lukšan L.: Combined Trust Region Methods for Nonlinear Least Squares. Kybernetika Vol. 32, 1996, pp.121-138. 27. Lukšan L., Vlček J.: Optimization of Dynamical Systems. Kybernetika Vol. 32, 1996, pp.465-482. 28. Lukšan L.: Hybrid Methods for Large Sparse Nonlinear Least Squares. Journal of Optimization Theory and Applications, Vol. 89, 1996, pp.575-595. 29. Lukšan L., Vlček J.: Algoritmus pro řešení rozsáhlých řídkých ůloh nelineárního programování s omezeními ve tvaru rovností. In: Sborník přednášek letní školy Programy a Algoritmy Numerické Matematiky 8, Janov 1996, pp.122-127. 30. Lukšan L., Vlček J.: Svazková metoda druhého řádu pro nehladkou nepodmíněnou minimalizaci. In: Sborník přednášek letní školy Programy a Algoritmy Numerické Matematiky 8, Janov 1996, pp.128-132. 31. Lukšan L., Vlček J.: Globally Convergent Methods with Inexact Jacobians for Systems of Nonlinear Equations. Proceedings of the Prague Mathematical Conference 1996. Prague, July 8-12, 1996, pp.159-164. 32. Lukšan L., Vlček J.: A Bundle-Newton Method for Nonsmooth Unconstrained Minimization. Proceedings of the Prague Mathematical Conference 1996. Prague, July 8-12, 1996, pp.165-170. 33. Lukšan L., Vlček J.: Truncated Trust Region Methods Based on Preconditioned Iterative Subalgorithms for Large Sparse Systems of Nonlinear Equations. Journal of Optimization Theory and Applications, Vol. 95, 1997, No. 3. pp.637-658. 34. Lukšan L.: Numerical methods for unconstrained optimization. Technical Report DMSIA 97/12, Universita degli Studi di Bergamo, 1997. 35. Lukšan L., Vlček J.: Computational Experience with Globally Convergent Descent Methods for Large Sparse Systems of Nonlinear Equations. Optimization Methods and Software, Vol. 8, 1998, pp.201-223.

36. Lukšan L., Vlček J.: Indefinitely Preconditioned Inexact Newton Method for Large Sparse Equality Constrained Nonlinear Programming Problems. Numerical Linear Algebra with Applications, Vol. 5, 1998, pp.219-247. 37. Lukšan L., Vlček J.: A Bundle-Newton Method for Nonsmooth Unconstrained Minimization. Mathematical Programming, Vol. 83, 1998, pp 373-391. 38. Lukšan L., Vlček J.: Indefinitní předpodmínění KKT systémů. In: Programy a Algoritmy Numerické Matematiky 9, Kořenov 1998, pp.115-120. 39. Lukšan L., Vlček J.: Užití metod s proměnnou metrikou pro nehladkou minimalizaci. In: Programy a Algoritmy Numerické Matematiky 9 Kořenov, 1998, pp.121-125. 40. Lukšan L., Spedicato E.: Variable metric methods for unconstrained optimization. Technical Report DMSIA 98/7, Universita degli Studi di Bergamo, 1997. 41. Lukšan L., Vlček J.: Sparse and Partially Separable Test Problems for Unconstrained and Equality Constrained Optimization. Technical Report V-767. Prague, ICS AS CR 1998. 42. Makela M.M., Miettinen M., Lukšan L., Vlček J.: Nonsmooth Optimization Methods Applied to Hemivariational Inequalities. Journal of Global Optimization, Vol.14, 1999, pp.117-135. 43. Lukšan L., Vlček J.: Globally convergent variable metric method for convex nonsmooth unconstrained minimization. Journal of Optimization Theory and Applications Vol.102, 1999, pp.593-613. 44. Lukšan L., Vlček J.: Conjugate gradient methods for saddle point systems. In: Proceedings of the 13-th Summer School on Software and Algorithms of Numerical Mathematics. Nečtiny, 1999, pp.223-231. 45. Vlček J., Lukšan L.: Variable metric method for nonconvex nonsmooth unconstrained minimization. In: Proceedings of the 13-th Summer School on Software and Algorithms of Numerical Mathematics. Nečtiny, 1999, pp.321-326. 46. Lukšan L., Spedicato E.: Variable metric methods for unconstrained optimization and nonlinear least squares. Journal of Computational and Applied Mathematics 124 (2000) 61-93. 47. Lukšan L., Vlček J.: Test problems for nonsmooth unconstrained and linearly constrained optimization. Technical Report V-798. Prague, ICS AS CR 2000. 48. Lukšan L., Vlček J.: Základy nehladké analýzy. Teorie a algoritmy. Technical Report V-808. Prague, ICS AS CR, 2000. 49. Lukšan L., Vlček J.: Introduction to nonsmooth analysis. Theory and algorithms. Technical Report DMSIA 00/1 (serie didattica), Universita degli Studi di Bergamo, 2000. 50. Lukšan L., Spedicato E.: A globally convergent nonlinear ABS algorithm. Technical Report DMSIA 00/3, Universita degli Studi di Bergamo, 2000. 51. Lukšan L., Vlček J.: Metoda vnitřních bodů pro nelineární nekonvexní optimalizaci. In: Sborník přednášek letní školy Programy a Algoritmy Numerické Matematiky 10, Libverda, 2000. 52. Lukšan L., Vlček J.: Metoda redukovaných Hessiánů pro nehladkou nepodmíněnou minimalizaci. In: Sborník přednášek letní školy Programy a Algoritmy Numerické Matematiky 10, Libverda, 2000. 53. Bodon E., Lukšan L., Spedicato E.: Computational experiments with linear ABS algorithms. Technical Report v-819. Prague, ICS AS CR, 2000. 54. Bodon E., Del Popolo A., Lukšan L., Spedicato E.: Computational experiments with ABS algorithms for overdetermined linear systems. Technical Report DMSIA 00/19, Universita degli Studi di Bergamo, 2000. 55. Bodon E., Del Popolo A., Lukšan L., Spedicato E.: Computational experiments with ABS algorithms for KKT linear systems. Technical Report DMSIA 00/20, Universita degli Studi di Bergamo, 2000.

56. Bodon E., Lukšan L., Spedicato E.: Computational experiments with ABS algorithms for determined and underdetermined linear systems. Technical Report DMSIA 00/21, Universita degli Studi di Bergamo, 2000. 57. Lukšan L., Vlček J.: Preconditioning of saddle-point systems. In: Proceedings of the conference SIMONA 2000, Liberec 2000. 58. Bodon E., Del Popolo A., Lukšan L., Spedicato E.: Numerical performance of ABS codes for systems of nonlinear equations. Technical Report DMSIA 01/01, Universita degli Studi di Bergamo, 2001. 59. Lukšan L., Vlček J.: Algorithm 811: NDA: Algorithms for nondifferentiable optimization. ACM Transactions on Mathematical Software, Vol.27, 2001, pp.193-213. 60. Vlček J., Lukšan L.: Globally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization. Journal of Optimization Theory and Applications, Vol.111, 2001, pp.407-430. 61. Bodon E., Del Popolo A., Lukšan L., Spedicato E.: Computational experiments with ABS algorithms for KKT linear systems. Optimization Methods and Software, Vol.16, 2001, pp.85-99. 62. Lukšan L., Vlček J.: Numerical experience with iterative methods for equality constrained nonlinear programming problems. Optimization Methods and Software, Vol.16, 2001, pp.257-287. 63. Lukšan L., Vlček J.: Nonsmooth equation method for general nonlinear programming. Proceedings of the Summer School Software and Algorithms of Numerical Mathematics, SANM 2001. Kvilda, 8-12 September 2003. 64. Bodon E., Lukšan L., Spedicato E.: Computational experiments with conjugate type ABS algorithms. Technical Report DMSIA 01/26, Universita degli Studi di Bergamo, 2001. 65. Bodon E., Lukšan L., Spedicato E.: Numerical performance of ABS codes for nonlinear least squares. Technical Report DMSIA 01/27, Universita degli Studi di Bergamo, 2001. 66. Lukšan L., Vlček J.: Řešení rozsáhlých řídkých úloh nelineárního programování. In: Sborník přednášek letní školy Programy a Algoritmy Numerické Matematiky 10, Maxov, 2002. 67. Vlček J., Lukšan L.: New variable metric methods for unconstrained minimization covering the largescale case. Technical Report v-876. Prague, ICS AS CR, 2002. 68. Lukšan L., Vlček J.: Programový systém pro univerzální funkcionální optimalizaci. Sborník konference Aplikace numerických metod v problematice podzemního skladování zemního plynu a v ložiskovém inenýrství. Lázně Libverda, 23-25 dubna 2003. 69. Lukšan L., Vlček J.: Variable metric methods for nonsmooth optimization. In: Numerical Linear Algebra and Optimization (Ya-xiang Yuan ed.), Science Press, Beijing (2003) 42-51. 70. Lukšan L., Matonoha C., Vlček J.: Interior point methods for large-scale nonlinear programming. Proceedings of the Summer School Numerical Methods for Local and Global Optimization: Sequential and Parallel Algorithms. Cortona, 14-20 July, 2003. 71. Lukšan L., Vlček J.: Discrete minimax approximation with application to filter design. Proceedings of the 2-nd International Workshop on Simulation, Modelling and Numerical Analysis, SIMONA 2003. Liberec, 1-3 September 2003. 72. Lukšan L., Vlček J.: Shifted variable metric methods for unconstrained optimization. Proceedings of the Summer School Software and Algorithms of Numerical Mathematics, SANM 2003. Hejnice, 8-12 September 2003. 73. Vlček J., Lukšan L.: New limited variable metric methods for unconstrained optimization. Proceedings of the Summer School Software and Algorithms of Numerical Mathematics, SANM 2003. Hejnice, 8-12 September 2003. 74. Lukšan L., Vlček J.: Test Problems for Unconstrained Optimization. Technical Report v-897. Prague, ICS AS CR, 2003.

75. Lukšan L., Vlček J.: Nonsmooth equation method for nonlinear nonconvex optimization. In: Conjugate Gradient Algorithms and Finite Element Methods (M.Křížek, P.Neittaanmäki, R.Glovinski, S.Korotov eds.). Springer Verlag, Berlin (2004) 131-145. 76. Lukšan L., Matonoha C., Vlček J.: Interior point method for nonlinear nonconvex optimization. Numerical Linear Algebra with Applications 11 (2004) 431-453. 77. Vlček J., Lukšan L.: Additional properties of shifted variable metric methods. Technical Report v-899. Prague, ICS AS CR, 2004. 78. Lukšan L., Vlček J.: Software system for universal functional optimization. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM 2004. Hotel Maxov, 6-11 June 2004. 79. Vlček J., Lukšan L.: Variationally-derived limited-memory methods for unconstrained optimization. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM 2004. Hotel Maxov, 6-11 June 2004. 80. Lukšan L., Matonoha C., Vlček J.: A shifted Steihaug-Toint method for computing trust-region step. Technical Report V-914. Prague, ICS AS CR, 2004. 81. Lukšan L., Vlček J.: Variable Metric Method for Minimization of Partially Separable Nonsmooth Functions. Technical Report V-916. Prague, ICS AS CR 2005. 82. Lukšan L., Rozložník M., Tůma M.: Programy pro řešení rovnic chemické rovnováhy. Technical Report V-954. Prague, ICS AS CR 2005. 83. Lukšan L., Stuchlý J., Vlček J.: Trust-region interior point method for large sparse inequality constrained optimization. Technical Report V-956, Prague, ICS AS CR, 2005. 84. Lukšan L., Matonoha C., Vlček J.: Interior point methods for large-scale nonlinear programming. Optimization Methods and software 20 (2005) 569-582. 85. Lukšan L., Vlček J.: Variable metric method for a class of large-scale nonsmooth functions. Proceedings of the Summer School Software and Algorithms of Numerical Mathematics, SANM 2003. Srni, 12-16 September 2005. 86. Vlček J., Lukšan L.: Shifted limited-memory variable metric methods for large-scale unconstrained minimization. J. of Computational and Applied Mathematics, 186 (2006) 365-390. 87. Lukšan L., Vlček J.: Variable metric method for minimization of partially separable nonsmooth functions. Pacific Journal on Optimization 2 (2006). 88. Lukšan L., Vlček J.: Efficient methods for large-scale unconstrained optimization. In: Large-scale Nonlinear Optimization (G. Di Pillo and M. Roma, Eds.), Kluwer (2006) 185-210. 89. Lukšan L., Matonoha C., Vlček J.: Interior-point method for large-scale minimax optimization. Proceedings of the Seminar Numerical Analysis. Moninec, 16-20 January 2006. 90. Lukšan L., Matonoha C., Vlček J.: A Shifted Steihaug-Toint Method for Computing a Trust-Region Step. Proceedings of the Seminar Numerical Analysis. Moninec, 16-20 January 2006. 91. Lukšan L., Matonoha C., Vlček J.: Interior-point method for large-scale l 1 optimization. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM 2006. Prague, 28-31 May 2006. 92. Lukšan L., Matonoha C., Vlček J.: Interior-point methods for minimization of composite nonsmooth functions. Proceedings of the Seminar Applied Mathematics SAMO 06. Ostravice, 13-15 September 2006. 93. Vlček J., Lukšan L.: New class of limited-memory variationally-derived variable metric methods. Technical Report V-973. Prague, ICS AS CR 2006.

94. Lukšan L., Matonoha C., Vlček J.: Interior Point Methods for Minimization of Composite Nonsmooth Functions. Technical Report V-987. Prague, ICS AS CR 2006. 95. Lukšan L., Rozložník M., Tůma M.: Programy pro řešení rovnic chemické kinetiky. Technical Report V-988. Prague, ICS AS CR 2006. 96. Lukšan L., Matonoha C., Vlček J.: Trust-region interior-point method for large sparse l 1 optimization. Optimization Methods and Software 22 (2007) 737-753. 97. Lukšan L., Hartman J., Zítko J.: Automatic differentiation and its program realization. Technical Report V-992. Prague, ICS AS CR 2007. 98. Lukšan L., Rozložník M., Tůma M. Vlček J.: Optimalizační programy vyvinuté pro řešení úloh chemické rovnováhy a chemické kinetiky. Technical Report TANDEM FT-TA/066. Prague 2007. 99. Lukšan L., Matonoha C., Vlček J.: New Subroutines for Large-Scale Optimization. Technical Report V-999. Prague, ICS AS CR 2007. 100. Lukšan L., Matonoha C., Vlček J.: Subroutines for Large-Scale Nonlinear Programming. Technical Report V-1000. Prague, ICS AS CR 2007. 101. Lukšan L., Hartman J.: Implementace automatického derivování v systému UFO. Technical Report V-1002. Prague, ICS AS CR 2007. 102. Lukšan L., Matonoha C., Vlček J.: Primal interior point method for minimization of generalized minimax functions. Technical Report V-1017. Prague, ICS AS CR 2007. 103. Vlček J., Lukšan L.: New class of limited-memory variationally-derived variable metric methods. Presented at the GAMM International Workshop Computational Methods with Applications, Harrachov, August 19 25, 2007. 104. Lukšan L., Matonoha C., Vlček J.: Trust-region interior point method for large sparse l 1 optimization. Presented at the GAMM International Workshop Computational Methods with Applications, Harrachov, August 19 25, 2007. 105. Lukšan L., Matonoha C., Vlček J.: Trust-region interior point methods for large sparse optimization. Presented at the IMA International Conference Numerical Linear Algebra and Optimization, Birmingham, September 13 15, 2007. 106. Lukšan L., Matonoha C., Vlček J.: Konvergence nelineární metody sdružených gradientů. Proceedings of the Seminar of Numerical Analysis SNA 08, Liberec, January 2008. 107. Lukšan L., Matonoha C., Vlček J.: On Lagrange multipliers of trust-region subproblems. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM 2008. Hotel Maxov, 1-6 June 2008. 108. Lukšan L., Matonoha C., Vlček J.: Primal interior point method for generalized minimax functions. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM 2008. Hotel Maxov, 1-6 June 2008. 109. Vlček J., Lukšan L.: Limited-memory variable metric methods based on invariant matrices. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM 2008. Hotel Maxov, 1-6 June 2008. 110. Lukšan L., Matonoha C., Vlček J.: Metody vnitřních bodů pro nekonvexní úlohy nelineárního programování. Sborník sedmého matematického workshopu. Brno, October 2008. 111. Lukšan L., Matonoha C., Vlček J.: On Lagrange multipliers of trust-region subproblems. BIT Numerical Analysis 48 (2008) 763-768. 112. Matonoha C., Lukšan L., Vlček J.: Interior-point method for nonlinear nonconvex optimization. Presented on 8-th GAMM Workshop, Hamburg, 11-12 September 2008.

113. Matonoha C., Lukšan L., Vlček J.: On Lagrange multipliers of trust-region subproblems. Presented on Applied Linear Algebra in Honor of Ivo Marek conference, Novi Sad, 28-30 April 2008. 114. Vlček J., Lukšan L.: Limited-memory projective variable metric methods for unconstrained minimization. Report V-1036. Prague, ICS AS CR 2008. 115. Vlček J., Lukšan L.: Transformations enabling to construct limited-memory Broyden class methods. Report V-1037. Prague, ICS AS CR 2008. 116. Lukšan L., Matonoha C., Vlček J.: Computational experience with modified conjugate gradient methods for unconstrained optimization. Report V-1038, Prague, ICS AS CR 2008. 117. Lukšan L., Matonoha C., Vlček J.: Interior point method for nonlinear programming with complementarity constraints. Report V-1039, Prague, ICS AS CR 2008. 118. Lukšan L.: Matematické programování. Report V-1043. Prague, ICS AS CR 2008. 119. Lukšan L., Matonoha C., Vlček J.: Computational experience with modified conjugate gradient methods for unconstrained optimization. Proceedings of the Seminar of Numerical Analysis SNA 09, Ostrava, January 2009. 120. Lukšan L., Matonoha C., Vlček J.: Interior point method for nonlinear programming with complementarity constraints. Modelling 2009, Rožnov pod Radhoštěm, June 2009. 121. Lukšan L., Matonoha C., Vlček J.: Interior-point Method for Nonlinear Nonconvex Optimization. Modelling 2009, Rožnov pod Radhoštěm, June 2009. 122. Vlček J., Lukšan L.: Transformations enabling to construct limited-memory Broyden class methods. Modelling 2009, Rožnov pod Radhoštěm, June 2009. 123. Lukšan L., Matonoha C., Vlček J.: Primal interior-point method for large sparse minimax optimization. Kybernetika 45 (2009) 841-864. 124. Hartman J., Lukšan L., Zítko J.: Automatic differentiation and its program realization. Kybernetika 45 (2009) 865-883. 125. Lukšan L., Matonoha C., Vlček J.: Algorithm 896: LSA: Algorithms for Large-Scale Optimization. ACM Transactions on Mathematical Software 36 (2009) 16:1-16:29. 126. Lukšan L., Vlček J.: Recursive formulation of limited memory variable metric methods. Proceedings of the Seminar of Numerical Analysis SNA 10, Nové Hrady, January 2010. 127. Lukšan L., Matonoha C., Vlček J.: Primal interior point method for minimization of generalized minimax functions. Kybernetika 46 (2010) 697-721. 128. Lukšan L., Matonoha C., Vlček J.: Sparse test problems for unconstrained optimization. Technical Report V-1064. Prague, ICS AS CR 2010. 129. Lukšan L., Matonoha C., Vlček J.: Band preconditioners for the matrix free truncated Newton method. Technical Report V-1079. Prague, ICS AS CR 2010. 130. Královcová J., Lukšan L., Mlýnek J.: Exposure optimization for warming of shapes in the automotive industry. Technical Report V-1080. Prague, ICS AS CR 2010. 131. Lukšan L., Matonoha C., Vlček J.: Modified CUTE Problems for Sparse Unconstrained Optimization. Technical Report V-1081. Prague, ICS AS CR 2010. 132. Lukšan L., Matonoha C., Vlček J.: Robust preconditioners for the matrix free truncated Newton method. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM 2010. Hotel Maxov, 6-11 June 2010. 133. Vlček J., Lukšan L.: Limited-memory variable metric methods that use quantities from the precedings iterations. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM 2010. Hotel Maxov, 6-11 June 2010.

134. Matonoha C., Lukšan L., Vlček J.: Interior-point method for nonlinear programming with complementarity constraints. IMA 2010 Conference, Birmingham, 13-15 September 2010. 135. Lukšan L., Matonoha C., Vlček J.: UFO-2010. Software system for universal functional optimization. Presented on the Seminar of Numerical Analysis SNA 11, Rožnov pod Radhoštěm, January 2011. 136. Lukšan L., Matonoha C., Vlček J.: Interior-Point Method for Nonlinear Programming with Complementarity Constraints. Presented on the SIAM Conference on Optimization, Darmstadt, 16-19 May 2011. 137. Lukšan L., Vlček J.: Recursive formulation of limited memory variable metric methods. Presented on the SIAM Conference on Optimization, Darmstadt, 16-19 May 2011. 138. Vlček J., Lukšan L.: Modifications of the limited-memory BNS method for better satisfaction of previous quasi-newton conditions. Technical Report V-1127. Prague, ICS AS CR 2011. 139. Lukšan L.: Numerické optimalizační metody. Technical Report V-1152. Prague, ICS AS CR, 2011. 140. Královcová J., Lukšan L., Mlýnek J.: Exposure optimization for warming the shapes in the automotive industry. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM 2012. Hotel Maxov, 3-8 June 2012. 141. Vlček J., Lukšan L.: Modifications of the limited-memory BFGS method based on the idea of conjugate directions. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM 2012. Hotel Maxov, 3-8 June 2012. 142. Vlček J., Lukšan L.: A conjugate directions approach to improve the limited-memory BFGS method. Applied Mathematics and Computation 219 (2012) 800-809. 143. Vlček J., Lukšan L.: Generalizations of the limited-memory BFGS method based on quasi-product form of update. Computational and Applied Mathematics Journal of Computational and Applied Mathematics 241 (2013) 116-129. 144. Lukšan L., Vlček J.: Recursive form of general limited memory variable metric methods. Kybernetika 49 (2013) 224-235. 145. Lukšan L., Vlček J.: Efficient tridiagonal preconditioner for the matrix-free truncated Newton method. SNA 14, Nymburk, January 2014. 146. Lukšan L., Vlček J.: Efficient tridiagonal preconditioner for the matrix-free truncated Newton method. Applied Mathematics and Computation 235 (2014) 394-407. 147. Lukšan L., Vlček J.: Nonlinear conjugate gradient methods. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM 2014. Hotel Maxov, 8-13 June 2014. 148. Vlček J., Lukšan L.: A modified limited-memory BNS method for unconstrained minimization derived from the conjugate directions idea. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM 2014. Hotel Maxov, 8-13 June 2014. 149. Lukšan L., Vlček J.: On variable metric methods for unconstrained minimization. SNA 15, Ostrava, January 2015. 150. Vlček J., Lukšan L.: A modified limited-memory BNS method for unconstrained minimization based on the conjugate directions idea. Optimization Methods and Software 30 (2015) 616-633. 151. Vlček J., Lukšan L.: A generalized limited-memory BNS method based on the block BFGS update. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM 2016. Janov nad Nisou, 19-24 June 2016. 152. Lukšan L., Vlček J.: New quasi-newton method for solving systems of nonlinear equations. Applications of Mathematics 62 (2017) 121-134.

153. Lukšan L., Tůma M., Matonoha C., Vlček J., Ramešová N., Šiška M., Hartman J.: UFO 2017. Interactive System for Universal Functional Optimization. Technical Report V-1252. Prague, ICS AS CR 2017. 154. Lukšan L., Matonoha C., Vlček J.: Numerical solution of generalized minimax problems. Technical Report V-1255. Prague, ICS AS CR 2018. 155. Lukšan L., Matonoha C., Vlček J.: Sparse Test Problems for Nonlinear Least Squares. Technical Report V-1258. Prague, CS AS CR 2018. 156. Lukšan L., Matonoha C., Vlček J.: Problems for Nonlinear Least Squares and Nonlinear Equations. Technical Report V-1259. Prague, ICS AS CR 2018. 157. Lukšan L., Vlček J.: A hybrid method for nonlinear least squares that uses quasi-newton updates applied to an approximation of the Jacobian matrix. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM 2018, Hejnice 24-29 June 2018. 158. Vlček J., Lukšan L.: Application of the infinitely many times repeated BNS update and conjugate directions to limited-memory optimization methods. Proceedings of the conference Programs and Algorithms of Numerical Mathematics PANM 2018, Hejnice 24-29 June 2018. 159. Vlček J., Lukšan L.: Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization. Numerical Algorithms 80 (2019) 957987. 160. Vlček J., Lukšan L.: A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions. Journal of Computational and Applied Mathematics 351 (2019) 14-28.