Cited in
(57)- New quasi-Newton method for solving systems of nonlinear equations.
- 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.
- Automatic differentiation and its program realization
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems
- Hybrid methods for large sparse nonlinear least squares
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method
- Estimation of diffusivity of phycobilisomes on thylakoid membrane based on spatio-temporal FRAP images
- Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem
- Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots
- Primal interior-point method for large sparse minimax optimization
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- Preconditioner updates for solving sequences of linear systems in matrix-free environment
- Comparison of public-domain software for black box global optimization∗
- On the optimization of initial conditions for a model parameter estimation.
- A generalized limited-memory BNS method based on the block BFGS update.
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
- Efficient Preconditioning of Sequences of Nonsymmetric Linear Systems
- Minimization of \(p\)-Laplacian via the finite element method in MATLAB
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions
- Subgradient and bundle methods for nonsmooth optimization
- Numerical experience with iterative methods for equality constrained nonlinear programming problems
- GNU Fortran
- PLCP
- GradSamp
- SQPlab
- ve08
- DGM
- PBNCGC
- PNEW
- QSM
- LDGB
- Stabhyli
- LSA
- scientific article; zbMATH DE number 1406968 (Why is no real title available?)
- Equal angle distribution of polling directions in direct-search methods
- An adaptive gradient sampling algorithm for non-smooth optimization
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
- Comparing different nonsmooth minimization methods and software
- Two limited-memory optimization methods with minimum violation of the previous secant conditions
- 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.
- Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations∗
- A modified limited-memory BNS method for unconstrained minimization derived from the conjugate directions idea.
- Robustness of supervised learning based on combined centroids
- 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
- Heat exposure optimization applied to moulding process in the automotive industry.
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- 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
- Truncated trust region methods based on preconditioned iterative subalgorithms for large sparse systems of nonlinear equations
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- 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
This page was built for software: UFO
