Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben

DOI10.1007/BF02260741zbMath0367.90101OpenAlexW5536954MaRDI QIDQ1242859

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)

Related Items (11)

On Newton's method for the Fermat-Weber location problem ⋮ Global convergence properties of two modified BFGS-type methods ⋮ Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung ⋮ Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization ⋮ 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 ⋮ Global convergence of the partitioned BFGS algorithm for convex partially separable optimization ⋮ On the resolution of monotone complementarity problems ⋮ Local convergence analysis for partitioned quasi-Newton updates ⋮ Convergence analysis of the general Gauss-Newton algorithm

Cites Work

• An effective algorithm for minimization
• Alternative proofs of the convergence properties of the conjugate- gradient method
• Function minimization by conjugate gradients
• Convergence Conditions for Ascent Methods
• The conjugate gradient method in extremal problems
• A General Convergence Result for Unconstrained Minimization Methods
• On methods of minimization with accelerated convergence
• Practical convergence conditions for unconstrained optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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