UFO

swMATH4719MaRDI QIDQ16887FDOQ16887

Author name not available (Why is that?)

Cited In (45)

Closed-form formulas vs. PDE based numerical solution for the FRAP data processing: theoretical and practical comparison
On parameter estimation in an in vitro compartmental model for drug-induced enzyme production in pharmacotherapy.
A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
Hybrid methods for large sparse nonlinear least squares
Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem
Efficient tridiagonal preconditioner for the matrix-free truncated Newton method
Estimation of diffusivity of phycobilisomes on thylakoid membrane based on spatio-temporal FRAP images
Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots
Preconditioner updates for solving sequences of linear systems in matrix-free environment
Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
Comparison of public-domain software for black box global optimization^∗
A hybrid method for nonlinear least squares that uses quasi-Newton updates applied to an approximation of the Jacobian matrix
Application of the infinitely many times repeated BNS update and conjugate directions to limited-memory optimization methods
A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
Efficient Preconditioning of Sequences of Nonsymmetric Linear Systems
A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
Minimization of \(p\)-Laplacian via the finite element method in MATLAB
Title not available (Why is that?)
A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
Numerical experience with iterative methods for equality constrained nonlinear programming problems
Title not available (Why is that?)
Title not available (Why is that?)
An adaptive gradient sampling algorithm for non-smooth optimization
Equal angle distribution of polling directions in direct-search methods
Subgradient and Bundle Methods for Nonsmooth Optimization
Comparing different nonsmooth minimization methods and software
Two limited-memory optimization methods with minimum violation of the previous secant conditions
A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations^∗
Robustness of supervised learning based on combined centroids
Title not available (Why is that?)
A generalized limited-memory BNS method based on the block BFGS update
On the optimization of initial conditions for a model parameter estimation
On the connection and equivalence of two methods for solving an ill-posed inverse problem based on FRAP data
Variable metric methods for unconstrained optimization and nonlinear least squares
Weak subgradient method for solving nonsmooth nonconvex optimization problems
Title not available (Why is that?)
Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization
A conjugate gradient sampling method for nonsmooth optimization
A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
Truncated trust region methods based on preconditioned iterative subalgorithms for large sparse systems of nonlinear equations
On an optimal setting of constant delays for the D-QSSA model reduction method applied to a class of chemical reaction networks.
A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions
On data space selection and data processing for parameter identification in a reaction-diffusion model based on FRAP experiments
New quasi-Newton method for solving systems of nonlinear equations.

This page was built for software: UFO