Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben

DOI10.1007/BF02260741MaRDI QIDQ1242859zbMATH OpenOpenAlexFDO

Authors Wolfgang Warth, Jochen Werner

Publication date 1977

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02260741

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites work

• scientific article; zbMATH DE number 3278849 (Why is no real title available?)
• scientific article; zbMATH DE number 3354513 (Why is no real title available?)
• scientific article; zbMATH DE number 3366717 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• scientific article; zbMATH DE number 3402375 (Why is no real title available?)
• scientific article; zbMATH DE number 3407464 (Why is no real title available?)
• A General Convergence Result for Unconstrained Minimization Methods
• Alternative proofs of the convergence properties of the conjugate- gradient method
• An effective algorithm for minimization
• Convergence Conditions for Ascent Methods
• Function minimization by conjugate gradients
• On methods of minimization with accelerated convergence
• Practical convergence conditions for unconstrained optimization
• The conjugate gradient method in extremal problems

Cited in

(12)

• Some properties of \([tr(Q^{2p})]^{1/2p}\) with application to linear minimax estimation
• The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
• A numerical method for an approximate minimax estimator in linear regression
• Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung
• Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
• On Newton's method for the Fermat-Weber location problem
• Global convergence properties of two modified BFGS-type methods
• On the resolution of monotone complementarity problems
• Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
• Globally linearly convergent nonlinear conjugate gradients without Wolfe line search
• Convergence analysis of the general Gauss-Newton algorithm
• Local convergence analysis for partitioned quasi-Newton updates

This page was built for publication: Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1242859)