An effective algorithm for minimization
From MaRDI portal
Publication:2528326
DOI10.1007/BF02162162zbMath0161.35402MaRDI QIDQ2528326
Publication date: 1967
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131783
Related Items
Stopping criteria for linesearch methods without derivatives, Global convergence and stabilization of unconstrained minimization methods without derivatives, 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, Global convergence properties of two modified BFGS-type methods, Recent advances in unconstrained optimization, A quasi-Newton method with Cholesky factorization, A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms, Descentwise inexact proximal algorithms for smooth optimization, A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods, Methods of conjugate directions versus quasi-Newton methods, Newton-type methods for unconstrained and linearly constrained optimization, Practical convergence conditions for unconstrained optimization, Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:, A class of gradient unconstrained minimization algorithms with adaptive stepsize, Global convergence of a modified BFGS-type method for unconstrained non-convex minimization, On Descent from Local Minima, A superlinearly convergent algorithm for minimization without evaluating derivatives, Practical convergence conditions for the Davidon-Fletcher-Powell method, A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule, Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems, Optimization of functions whose values are subject to small errors, 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, 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, Rayleigh quotient minimization method for symmetric eigenvalue problems, A note on a sufficient-decrease criterion for a non-derivative step-length procedure, 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, On the Shwarz alternating method in problems of elastic stability
Cites Work
