Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben
From MaRDI portal
Publication:1242859
DOI10.1007/BF02260741zbMATH Open0367.90101OpenAlexW5536954MaRDI QIDQ1242859FDOQ1242859
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
Cites Work
- Function minimization by conjugate gradients
- Convergence Conditions for Ascent Methods
- The conjugate gradient method in extremal problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An effective algorithm for minimization
- Alternative proofs of the convergence properties of the conjugate- gradient method
- Title not available (Why is that?)
- On methods of minimization with accelerated convergence
- Practical convergence conditions for unconstrained optimization
- A General Convergence Result for Unconstrained Minimization Methods
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
- Global convergence properties of two modified BFGS-type methods
- On Newton's method for the Fermat-Weber location problem
- 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)
