Quasi-Newton Methods for Unconstrained Optimization
From MaRDI portal
Cited in
(59)- Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
- Generating conjugate directions without line searches using factorized variable metric updating formulas
- A new and dynamic method for unconstrained minimization
- A Bregman extension of quasi-Newton updates I: An information geometrical framework
- Updating conjugate directions by the BFGS formula
- Some investigations in a new algorithm for nonlinear optimization based on conic models of the objective function
- An alternative variational principle for variable metric updating
- On line structure selection for multivariable state-space models
- A Bregman extension of quasi-Newton updates. II: Analysis of robustness properties
- Probit and logistic discriminant functions
- Hybrid method for nonlinear least-square problems without calculating derivatives
- The use of optimization techniques in the analysis of cracked members by the finite element displacement and stress methods
- FIML estimation of dynamic econometric systems from inconsistent data
- Performance of various BFGS implementations with limited precision second-order information
- Training multi-layered neural network with a trust-region based algorithm
- Global stability analysis and direct numerical simulation of boundary layers with an isolated roughness element
- DISOPT—A general programme for continuous and discrete non-linear programming problems†
- The simplification of linear discrete-time systems by model-following methods
- A truncated Newton optimization algorithm in meteorology applications with analytic Hessian/vector products
- Minimizing a differentiable function over a differential manifold
- A class of generalized variable penalty methods for nonlinear programming
- A quasi-Gauss-Newton method for solving nonlinear algebraic equations
- Newton and quasi-Newton methods for normal maps with polyhedral sets
- Matrix factorizations in optimization of nonlinear functions subject to linear constraints
- Large-scale linearly constrained optimization
- A derivative-free optimization algorithm combining line-search and trust-region techniques
- An \(LDL^{\mathrm{T}}\) trust-region quasi-Newton method
- A new BFGS algorithm using the decomposition matrix of the correction matrix to obtain the search directions
- Experiments with new stochastic global optimization search techniques
- Methods for Modifying Matrix Factorizations
- A variable projection method for solving separable nonlinear least squares problems
- A numerically stable form of the simplex algorithm
- An improved trust region method for unconstrained optimization
- An improved variable penalty algorithm for automated structural design
- A class of differential descent methods for constrained optimization
- Theory of generalized discrepancies on a ball of arbitrary finite dimensions and algorithms for finding low-discrepancy point sets
- Dynamic search trajectory methods for global optimization
- Young's double-slit experiment optimizer : a novel metaheuristic optimization algorithm for global and constraint optimization problems
- A family of variable metric updates
- Factorized Variable Metric Methods for Unconstrained Optimization
- Variable penalty methods for constrained minimization
- Incremental multiple hidden layers regularized extreme learning machine based on forced positive-definite Cholesky factorization
- scientific article; zbMATH DE number 6870925 (Why is no real title available?)
- Nonparametric control for residual heterogeneity in modelling recurrent behaviour
- 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
- Nonstationary Markov decision problems with converging parameters
- A new arc algorithm for unconstrained optimization
- A discrete Newton algorithm for minimizing a function of many variables
- Multiple group logistic discrimination
- The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications
- Newton-type methods for unconstrained and linearly constrained optimization
- Inelastic analysis of suspension structures by nonlinear programming
- Extended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing
- Derivative-free optimization with transformed objective functions and the algorithm based on the least Frobenius norm updating quadratic model
- An assessment of two approaches to variable metric methods
- A comparison of numerical methods for the solution of quasilinear equations
- Approximation methods for the unconstrained optimization
- On the Local and Superlinear Convergence of a Parameterized DFP Method
This page was built for publication: Quasi-Newton Methods for Unconstrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5680690)
