National Repository of Grey Literature 137 records found  previous11 - 20nextend  jump to record: Search took 0.01 seconds. 
Application of the Infinitely Many Times Repeated BNS Update and Conjugate Directions to Limited-Memory Optimization Methods
Vlček, Jan ; Lukšan, Ladislav
To improve the performance of the L-BFGS method for large scale unconstrained optimization, repeating of some BFGS updates was proposed. Since this can be time consuming, the extra updates need to be selected carefully. We show that groups of these updates can be repeated infinitely many times under some conditions, without a noticeable increase of the computational time. The limit update is a block BFGS update. It can be obtained by solving of some Lyapunov matrix equation whose order can be decreased by application of vector corrections for conjugacy. Global convergence of the proposed algorithm is established for convex and sufficiently smooth functions. Numerical results indicate the efficiency of the new method.
Mountain hotel
Vlček, Jan ; Pilný, Ondřej (referee) ; Berková, Petra (advisor)
The aim of this diploma thesis is to design a mountain hotel in the village Rokytnice nad Jizernou. The object is placed on a sloping plot located in an attractive touristic and skiing area of mountain range Krkonoše. The mountain hotel has 4 floors and a basement. In the First floor there is a restaurant with a terrace, kitchen and administrative facilities of hotel. In the second and third floor we can find guest rooms and room for the hotel staff. In the basement there is wellness, technical facilities and garage compound. Construction of building is made of the reinforced concrete monolithic transverse frames with beam filling of ceramic block.
A Hybrid Method for Nonlinear Least Squares that Uses Quasi-Newton Updates Applied to an Approximation of the Jacobian Matrix
Lukšan, Ladislav ; Vlček, Jan
In this contribution, we propose a new hybrid method for minimization of nonlinear least squares. This method is based on quasi-Newton updates, applied to an approximation A of the Jacobian matrix J, such that AT f = JT f. This property allows us to solve a linear least squares problem, minimizing ∥Ad+f∥ instead of solving the normal equation ATAd+JT f = 0, where d ∈ Rn is the required direction vector. Computational experiments confirm the efficiency of the new method.
Problems for Nonlinear Least Squares and Nonlinear Equations
Lukšan, Ladislav ; Matonoha, Ctirad ; Vlček, Jan
This report contains a description of subroutines which can be used for testing large-scale optimization codes. These subroutines can easily be obtained from the web page http://www.cs.cas.cz/~luksan/test.html. Furthermore, all test problems contained in these subroutines are presented in the analytic form.
Plný tet: Download fulltextPDF
Sparse Test Problems for Nonlinear Least Squares
Lukšan, Ladislav ; Matonoha, Ctirad ; Vlček, Jan
This report contains a description of subroutines which can be used for testing large-scale optimization codes. These subroutines can easily be obtained from the web page http://www.cs.cas.cz/~luksan/test.html. Furthermore, all test problems contained in these subroutines are presented in the analytic form.
Fulltext: content.csg - Download fulltextPDF
Plný tet: V1258-18 - Download fulltextPDF
UFO 2017. Interactive System for Universal Functional Optimization
Lukšan, Ladislav ; Tůma, Miroslav ; Matonoha, Ctirad ; Vlček, Jan ; Ramešová, Nina ; Šiška, M. ; Hartman, J.
This report contains a description of the interactive system for universal functional optimization UFO, version 2017. This version contains interfaces to the MATLAB and SCILAB graphics environments.

National Repository of Grey Literature : 137 records found   previous11 - 20nextend  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.