scientific article; zbMATH DE number 3617919
From MaRDI portal
Publication:4181625
zbMath0397.90088MaRDI QIDQ4181625
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Roundoff error (65G50)
Related Items
Some superlinearly convergent inexact generalized Newton method for solving nonsmooth equations, On the local convergence of adjoint Broyden methods, Mechanical system modelling using recurrent neural networks via quasi- Newton learning methods, Inexact Newton methods for solving nonsmooth equations, Global convergence and the Powell singular function, A quasi-Newton based pattern search algorithm for unconstrained optimization, Successive column correction algorithms for solving sparse nonlinear systems of equations, A note on solving nonlinear optimization problems in variable precision, Computational experience with conjugate gradient algorithms, Perspectives on self-scaling variable metric algorithms, An assessment of quasi-Newton sparse update techniques for nonlinear structural analysis, A trust-region method with a conic model for unconstrained optimization, Conjugate gradient methods using quasi-Newton updates with inexact line searches, Convergence analysis of the self-dual optimally conditioned ssvm method of oren-spedicato, Robust confidence intervals applied to crossover operator for real-coded genetic algorithms, A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization, Global convergence property of scaled two-step BFGS method, Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy∗, Matrix conditioning and nonlinear optimization, An assessment of two approaches to variable metric methods, On some classes of variationally derived quasi-Newton methods for systems of nonlinear algebraic equations, Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm, A restricted trust region algorithm for unconstrained optimization, Computational experience with bank-one positive definite quasi-newton algorithms, Secant relations versus positive definiteness in quasi-Newton methods, A fast and robust unconstrained optimization method requiring minimum storage
