Quasi-Newton Methods for Unconstrained Optimization
From MaRDI portal
Publication:5680690
DOI10.1093/imamat/9.1.91zbMath0264.49026OpenAlexW2145126461MaRDI QIDQ5680690
Publication date: 1972
Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imamat/9.1.91
Related Items
Factorized Variable Metric Methods for Unconstrained Optimization, A truncated Newton optimization algorithm in meteorology applications with analytic Hessian/vector products, Nonparametric control for residual heterogeneity in modelling recurrent behaviour, Newton and quasi-Newton methods for normal maps with polyhedral sets, Performance of various BFGS implementations with limited precision second-order information, Hybrid method for nonlinear least-square problems without calculating derivatives, Training multi-layered neural network with a trust-region based algorithm, Nonstationary Markov decision problems with converging parameters, A class of generalized variable penalty methods for nonlinear programming, A new BFGS algorithm using the decomposition matrix of the correction matrix to obtain the search directions, Young's double-slit experiment optimizer : a novel metaheuristic optimization algorithm for global and constraint optimization problems, A class of differential descent methods for constrained optimization, Variable penalty methods for constrained minimization, Methods for Modifying Matrix Factorizations, A derivative-free optimization algorithm combining line-search and trust-region techniques, Minimizing a differentiable function over a differential manifold, Newton-type methods for unconstrained and linearly constrained optimization, Updating conjugate directions by the BFGS formula, A variable projection method for solving separable nonlinear least squares problems, An improved variable penalty algorithm for automated structural design, On line structure selection for multivariable state-space models, A new and dynamic method for unconstrained minimization, A Bregman extension of quasi-Newton updates. II: Analysis of robustness properties, Multiple group logistic discrimination, On the Local and Superlinear Convergence of a Parameterized DFP Method, DISOPT—A general programme for continuous and discrete non-linear programming problems†, A quasi-Gauss-Newton method for solving nonlinear algebraic equations, A Bregman extension of quasi-Newton updates I: an information geometrical framework, Inelastic analysis of suspension structures by nonlinear programming, A comparison of numerical methods for the solution of quasilinear equations, An assessment of two approaches to variable metric methods, Matrix factorizations in optimization of nonlinear functions subject to linear constraints, Approximation methods for the unconstrained optimization, Large-scale linearly constrained optimization, An improved trust region method for unconstrained optimization, A new arc algorithm for unconstrained optimization, A family of variable metric updates, Dynamic search trajectory methods for global optimization, Theory of generalized discrepancies on a ball of arbitrary finite dimensions and algorithms for finding low-discrepancy point sets, Generating conjugate directions without line searches using factorized variable metric updating formulas, The use of optimization techniques in the analysis of cracked members by the finite element displacement and stress methods, Incremental multiple hidden layers regularized extreme learning machine based on forced positive-definite Cholesky factorization, The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications, Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization, Experiments with new stochastic global optimization search techniques, A numerically stable form of the simplex algorithm, A discrete Newton algorithm for minimizing a function of many variables, The simplification of linear discrete-time systems by model-following methods, Probit and logistic discriminant functions, Some investigations in a new algorithm for nonlinear optimization based on conic models of the objective function, FIML estimation of dynamic econometric systems from inconsistent data, On diagonally-preconditioning the 2-step BFGS method with accumulated steps for linearly constrained nonlinear programming, A quasi-Newton method with sparse triple factorization for unconstrained minimization, An alternative variational principle for variable metric updating, Unnamed Item, Global stability analysis and direct numerical simulation of boundary layers with an isolated roughness element, Extended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing
