Variance algorithm for minimization
From MaRDI portal
Cited in
(36)- Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
- Projection algorithms for linear programming
- On the local convergence of adjoint Broyden methods
- Proability estimation usind a multinominal logistic function†
- Time evolutional analysis of nonlinear structures
- Cubic regularization in symmetric rank-1 quasi-Newton methods
- A derivative-free nonmonotone line-search technique for unconstrained optimization
- Recent advances in unconstrained optimization
- Methods of conjugate directions versus quasi-Newton methods
- A variance algorithm for constrained minimization with linear constraints
- Variable neighbourhood search: methods and applications
- The Convergence of Single-Rank Quasi-Newton Methods
- Minimum Norm Symmetric Quasi-Newton Updates Restricted to Subspaces
- Greedy quasi-Newton methods with explicit superlinear convergence
- Regularized step directions in nonlinear conjugate gradient methods
- An algorithm that minimizes homogeneous functions of \(n\) variables in \(n + 2\) iterations and rapidly minimizes general functions
- Subspace selection algorithms to be used with the nonlinear projection methods in solving systems of nonlinear equations
- Mechanical system modelling using recurrent neural networks via quasi- Newton learning methods
- Unconstrained optimization based on homogeneous models
- Bayesian analysis of lymphatic spreading patterns in cancer of the thoracic esophagus
- Respecifying the weighting matrix of a quadratic objective function
- Partitioned simulation of fluid-structure interaction. Coupling black-box solvers with quasi-Newton techniques
- Two examples on the convergence of certain rank-2 minimization methods for quadratic functionals in Hilbert space
- A feed-forward neural network for solving Stokes problem
- On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems
- Factorized Variable Metric Methods for Unconstrained Optimization
- A Family of Variable-Metric Methods Derived by Variational Means
- An intelligent algorithm for mixed-integer programming models
- An approach for analyzing the global rate of convergence of quasi-Newton and truncated-Newton methods
- Pair potential calculation of molecular associations: A vectorized version
- A numerical implementation of the maximum-likelihood method of parameter estimation for tracer-kinetic data
- A variant of the generalized reduced gradient algorithm for non-linear programming and its applications
- An improved penalty function method for solving constrained parameter optimization problems
- A rank-one algorithm for unconstrained function minimization
- Square-root variable-metric methods for minimization
- Approximation methods for the unconstrained optimization
This page was built for publication: Variance algorithm for minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5538009)
