The following pages link to UFO (Q16887):
Displayed 45 items.
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method (Q272460) (← links)
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
- On the connection and equivalence of two methods for solving an ill-posed inverse problem based on FRAP data (Q492119) (← links)
- Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization (Q670492) (← links)
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems (Q831368) (← links)
- Equal angle distribution of polling directions in direct-search methods (Q896733) (← links)
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
- Truncated trust region methods based on preconditioned iterative subalgorithms for large sparse systems of nonlinear equations (Q1379937) (← links)
- Variable metric methods for unconstrained optimization and nonlinear least squares (Q1593813) (← links)
- On data space selection and data processing for parameter identification in a reaction-diffusion model based on FRAP experiments (Q1668936) (← links)
- A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions (Q1715789) (← links)
- Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots (Q1736232) (← links)
- Hybrid methods for large sparse nonlinear least squares (Q1918021) (← links)
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions (Q2023656) (← links)
- Two limited-memory optimization methods with minimum violation of the previous secant conditions (Q2057221) (← links)
- On an optimal setting of constant delays for the D-QSSA model reduction method applied to a class of chemical reaction networks. (Q2093348) (← links)
- Minimization of \(p\)-Laplacian via the finite element method in MATLAB (Q2128481) (← links)
- Robustness of supervised learning based on combined centroids (Q2148743) (← links)
- A conjugate gradient sampling method for nonsmooth optimization (Q2174178) (← links)
- Estimation of diffusivity of phycobilisomes on thylakoid membrane based on spatio-temporal FRAP images (Q2256508) (← links)
- On parameter estimation in an in vitro compartmental model for drug-induced enzyme production in pharmacotherapy. (Q2315462) (← links)
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
- New quasi-Newton method for solving systems of nonlinear equations. (Q2360415) (← links)
- Closed-form formulas vs. PDE based numerical solution for the FRAP data processing: theoretical and practical comparison (Q2402239) (← links)
- Numerical experience with iterative methods for equality constrained nonlinear programming problems (Q2774608) (← links)
- Subgradient and Bundle Methods for Nonsmooth Optimization (Q2838345) (← links)
- An adaptive gradient sampling algorithm for non-smooth optimization (Q2867436) (← links)
- Comparing different nonsmooth minimization methods and software (Q2885467) (← links)
- Preconditioner updates for solving sequences of linear systems in matrix-free environment (Q3090810) (← links)
- (Q3456458) (← links)
- Efficient Preconditioning of Sequences of Nonsymmetric Linear Systems (Q3525947) (← links)
- (Q3552458) (← links)
- (Q3552459) (← links)
- Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations<sup>∗</sup> (Q3839446) (← links)
- Comparison of public-domain software for black box global optimization<sup>∗</sup> (Q4508677) (← links)
- On the optimization of initial conditions for a model parameter estimation (Q4562672) (← links)
- A generalized limited-memory BNS method based on the block BFGS update (Q4562687) (← links)
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization (Q4646678) (← links)
- (Q4940821) (← links)
- Weak subgradient method for solving nonsmooth nonconvex optimization problems (Q5009157) (← links)
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions (Q5058380) (← links)
- A hybrid method for nonlinear least squares that uses quasi-Newton updates applied to an approximation of the Jacobian matrix (Q5116983) (← links)
- Application of the infinitely many times repeated BNS update and conjugate directions to limited-memory optimization methods (Q5116992) (← links)
- (Q5269095) (← links)
- Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem (Q5299913) (← links)