On the Relative Efficiencies of Gradient Methods

From MaRDI portal
Revision as of 03:29, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5542526

DOI10.2307/2003238zbMath0159.20305OpenAlexW4241324043MaRDI QIDQ5542526

John Greenstadt

Publication date: 1967

Full work available at URL: https://doi.org/10.2307/2003238




Related Items (22)

Three-way metric unfolding via alternating weighted least squaresAn output error model and algorithm for electromagnetic system identificationRecent advances in unconstrained optimizationStepsize analysis for descent methodsA revised method of scoringOn the efficient computation of the nonlinear full-information maximum- likelihood estimatorA primal-dual augmented LagrangianNewton-type methods for unconstrained and linearly constrained optimizationA modified Newton's method for minimizing factorable functionsA Newton-Based Method for Nonconvex Optimization with Fast Evasion of Saddle PointsMultiple roots of the Tobit log-likelihoodA superlinearly convergent algorithm for minimization without evaluating derivativesA modified Newton method for the solution of ill-conditioned systems of nonlinear equations with application to multiple shootingA Newton-type curvilinear search method for optimizationA modified Newton method for minimizationApproximation methods for the unconstrained optimizationA numerically stable and efficient technique for the maintenance of positive definiteness in the Hessian for Newton-type methodsUnified approach to unconstrained minimization via basic matrix factorizationsCensored regression models with unobserved, stochastic censoring thresholdsStatistical aspects of a three-mode factor analysis modelNonlinear programming: A quadratic analysis of ridge paralysisA diverse strategy method of minimization




Cites Work




This page was built for publication: On the Relative Efficiencies of Gradient Methods