UFO

The universal functional optimization (UFO) system is an interactive modular system for solving both dense medium-size and sparse large-scale optimization problems. The UFO system can be used for the following applications: 1. Formulation and solution of particular optimization problems that are described in Chapter 2. 2. Preparation of specialized optimization routines (or subroutines) based on methods described in Chapter 3. 3. Designing and testing new optimization methods. The UFO system is a very useful tool for the development of optimization algorithms. The special realization of the UFO system described in the subsequent text makes this system portable and extensible and we continue with its further development.


References in zbMATH (referenced in 32 articles )

Showing results 1 to 20 of 32.
Sorted by year (citations)

1 2 next

  1. Keskar, N.; Wächter, Andreas: A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization (2019)
  2. Kuřátko, Jan: Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots (2019)
  3. Vlček, Jan; Lukšan, Ladislav: Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization (2019)
  4. Vlček, Jan; Lukšan, Ladislav: A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions (2019)
  5. Matonoha, Ctirad; Papáček, Štěpán; Kindermann, Stefan: On the optimization of initial conditions for a model parameter estimation. (2017)
  6. Papáček, Štěpán; Macdonald, Benn; Matonoha, Ctirad: Closed-form formulas vs. PDE based numerical solution for the FRAP data processing: theoretical and practical comparison (2017)
  7. Vlček, Jan; Lukšan, Ladislav: A generalized limited-memory BNS method based on the block BFGS update. (2017)
  8. Yousefpour, Rohollah: Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (2016)
  9. Akbari, Z.; Yousefpour, R.; Reza Peyghami, M.: A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (2015)
  10. Curtis, Frank E.; Que, Xiaocun: A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (2015)
  11. Kindermann, Stefan; Papáček, Štěpán: On data space selection and data processing for parameter identification in a reaction-diffusion model based on FRAP experiments (2015)
  12. Matonoha, C.; Papáček, Š.: On the connection and equivalence of two methods for solving an ill-posed inverse problem based on FRAP data (2015)
  13. Vlček, Jan; Lukšan, Ladislav: A modified limited-memory BNS method for unconstrained minimization derived from the conjugate directions idea. (2015)
  14. Lukšan, Ladislav; Vlček, Jan: Efficient tridiagonal preconditioner for the matrix-free truncated Newton method (2014)
  15. Van Dyke, Benjamin: Equal angle distribution of polling directions in direct-search methods (2014)
  16. Curtis, Frank E.; Que, Xiaocun: An adaptive gradient sampling algorithm for non-smooth optimization (2013)
  17. Královcová, Jiřina; Lukšan, Ladislav; Mlýnek, Jaroslav: Heat exposure optimization applied to moulding process in the automotive industry. (2013)
  18. Mäkelä, Marko M.; Karmitsa, Napsu; Bagirov, Adil: Subgradient and bundle methods for nonsmooth optimization (2013)
  19. Papáček, Štěpán; Kaňa, Radek; Matonoha, Ctirad: Estimation of diffusivity of phycobilisomes on thylakoid membrane based on spatio-temporal FRAP images (2013)
  20. Rojas, Marielba; Fotland, Bjørn H.; Steihaug, Trond: Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem (2013)

1 2 next