An effective algorithm for minimization
From MaRDI portal
Cites work
Cited in
(40)- On the Shwarz alternating method in problems of elastic stability
- Global convergence and stabilization of unconstrained minimization methods without derivatives
- A quasi-Newton method with Cholesky factorization
- A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms
- A modified Newton method for minimization
- Approximation methods for the unconstrained optimization
- Accelerated conjugate direction methods for unconstrained optimization
- Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben
- A quasi-Newton method for minimization under linear constraints without evaluating any derivatives
- In favor of conjugate directions: a generalized acceptable-point algorithm for function minimization
- Descentwise inexact proximal algorithms for smooth optimization
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- A robust algorithm for rate-independent crystal plasticity
- LMBOPT: a limited memory method for bound-constrained optimization
- An active set trust-region method for bound-constrained optimization
- Rayleigh quotient minimization method for symmetric eigenvalue problems
- Global convergence of a modified BFGS-type method for unconstrained non-convex minimization
- Scaling of matrices to achieve specified row and column sums
- Solution of monotone nonlinear elliptic boundary value problems
- An application of the generalized Aitken-Steffensen method to the problem of minimizing a function
- Stopping criteria for linesearch methods without derivatives
- A note on a sufficient-decrease criterion for a non-derivative step-length procedure
- Newton-type methods for unconstrained and linearly constrained optimization
- A superlinearly convergent algorithm for minimization without evaluating derivatives
- Practical convergence conditions for the Davidon-Fletcher-Powell method
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Optimization of functions whose values are subject to small errors
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
- On Descent from Local Minima
- Recent advances in unconstrained optimization
- Methods of conjugate directions versus quasi-Newton methods
- Practical convergence conditions for unconstrained optimization
- An active set method for bound-constrained optimization
- Semi-monotone Goldstein line search strategy with application in sparse recovery
- An improvement of the Goldstein line search
- On diagonally-preconditioning the 2-step BFGS method with accumulated steps for linearly constrained nonlinear programming
- On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming
- Global convergence properties of two modified BFGS-type methods
- A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
This page was built for publication: An effective algorithm for minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2528326)
