Conditioning of Quasi-Newton Methods for Function Minimization

DOI10.2307/2004840zbMath0225.65073OpenAlexW4241367446MaRDI QIDQ5632068

David F. Shanno

Publication date: 1971

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (only showing first 100 items - show all)

Full-low evaluation methods for derivative-free optimization ⋮ Quasi-Newton methods for machine learning: forget the past, just sample ⋮ Archetypal landscapes for deep neural networks ⋮ Confidence intervals based on the deviance statistic for the hyperparameters in state space models ⋮ Active Neuron Least Squares: A Training Method for Multivariate Rectified Neural Networks ⋮ Recent advances in unconstrained optimization ⋮ Towards explicit superlinear convergence rate for SR1 ⋮ Non-asymptotic superlinear convergence of standard quasi-Newton methods ⋮ Variable metric method for unconstrained multiobjective optimization problems ⋮ Sample size optimization and initial allocation of the significance levels in group sequential trials with multiple endpoints ⋮ Asset classification under the IFRS 9 framework for the construction of a banking investment portfolio ⋮ Proposal of a modified optimality criteria method for topology optimization analysis in 3‐dimensional dynamic oscillation problems ⋮ Non‐linear space‐time elasticity ⋮ Quantum alternating operator ansatz for solving the minimum exact cover problem ⋮ An overview of stochastic quasi-Newton methods for large-scale machine learning ⋮ Simulating comparisons of different computing algorithms fitting zero-inflated Poisson models for zero abundant counts ⋮ Addressing discontinuous root-finding for subsequent differentiability in machine learning, inverse problems, and control ⋮ A \(J\)-symmetric quasi-Newton method for minimax problems ⋮ Efficient approximations of the fisher matrix in neural networks using kronecker product singular value decomposition ⋮ A new taxonomy of global optimization algorithms ⋮ Fast, Approximate Maximum Likelihood Estimation of Log-Gaussian Cox Processes ⋮ Numerical Approximations of the Allen-Cahn-Ohta-Kawasaki Equation with Modified Physics-Informed Neural Networks (Pinns) ⋮ Efficient variable cell shape geometry optimization ⋮ Competitive secant (BFGS) methods based on modified secant relations for unconstrained optimization ⋮ Greedy PSB methods with explicit superlinear convergence ⋮ Pole-fitting for complex functions: enhancing standard techniques by artificial-neural-network classifiers and regressors ⋮ Computational issues in parameter estimation for hidden Markov models with template model builder ⋮ Continuous Newton-like Methods Featuring Inertia and Variable Mass ⋮ On the global minimum of the classical potential energy for clusters bound by many-body forces ⋮ Approximating Higher-Order Derivative Tensors Using Secant Updates ⋮ The regularization continuation method for optimization problems with nonlinear equality constraints ⋮ An adaptive projection BFGS method for nonconvex unconstrained optimization problems ⋮ Quasi Newton techniques generate identical points II: The proofs of four new theorems ⋮ Evidence for hedge fund predictability from a multivariate Student'stfull-factor GARCH model ⋮ A Flexible Zero-Inflated Poisson-Gamma Model with Application to Microbiome Sequence Count Data ⋮ A New Diagonal Quasi-Newton Updating Method With Scaled Forward Finite Differences Directional Derivative for Unconstrained Optimization ⋮ A multivariate single-index model for longitudinal data ⋮ Fast and Accurate Binary Response Mixed Model Analysis via Expectation Propagation ⋮ Optimization Methods for Large-Scale Machine Learning ⋮ Identification of Elastic Orthotropic Material Parameters by the Singular Boundary Method ⋮ A family of quasi-Newton methods for unconstrained optimization problems ⋮ Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions ⋮ On the Foundations and the Applications of Evolutionary Computing ⋮ Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization ⋮ Self-consistent description of radial space-charge confinement in DC column plasmas ⋮ Implicit updates in multistep quasi-Newton methods ⋮ A nonlinear model for function-value multistep methods ⋮ On quasi-Newton methods in fast Fourier transform-based micromechanics ⋮ Accelerated Residual Methods for the Iterative Solution of Systems of Equations ⋮ New optimization approach to multiphase flow. ⋮ Finding Extremal Periodic Orbits with Polynomial Optimization, with Application to a Nine-Mode Model of Shear Flow ⋮ Model‐based clustering of regression time series data via APECM—an AECM algorithm sung to an even faster beat ⋮ A robust multi-batch L-BFGS method for machine learning ⋮ The type I half-logistic family of distributions ⋮ Symmetric minimum-norm updates for use in gibbs free energy calculations ⋮ Probabilistic Line Searches for Stochastic Optimization ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Greedy Quasi-Newton Methods with Explicit Superlinear Convergence ⋮ Unnamed Item ⋮ COCO: a platform for comparing continuous optimizers in a black-box setting ⋮ Heavy or semi-heavy tail, that is the question ⋮ On the record-based transmuted model of balakrishnan and He based on weibull distribution ⋮ Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation ⋮ Optimization with hidden constraints and embedded Monte Carlo computations ⋮ Factorized Variable Metric Methods for Unconstrained Optimization ⋮ Five different distributions for the Lee-Carter model of mortality forecasting: a comparison using GAS models ⋮ A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization ⋮ On obtaining sparse semantic solutions for inverse problems, control, and neural network training ⋮ Data assimilation by field alignment ⋮ Full waveform inversion through double-sweeping solver ⋮ Finite mixture modeling of Gaussian regression time series with application to dendrochronology ⋮ A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update ⋮ On Variable-Metric Methods for Sparse Hessians ⋮ Cluster Gauss-Newton method. An algorithm for finding multiple approximate minimisers of nonlinear least squares problems with applications to parameter estimation of pharmacokinetic models ⋮ Long-term prediction of the metals' prices using non-Gaussian time-inhomogeneous stochastic process ⋮ Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms ⋮ Minimum Norm Symmetric Quasi-Newton Updates Restricted to Subspaces ⋮ On \(q\)-BFGS algorithm for unconstrained optimization problems ⋮ Speeding up the scaled conjugate gradient algorithm and its application in neuro-fuzzy classifier training ⋮ Algorithms for strong coupling procedures ⋮ Limited-memory BFGS with displacement aggregation ⋮ Rates of superlinear convergence for classical quasi-Newton methods ⋮ Annealing stochastic approximation Monte Carlo algorithm for neural network training ⋮ Bilinear Quadratures for Inner Products ⋮ The Power M-Gaussian Distribution: An R-Symmetric Analog of the Exponential-Power Distribution ⋮ Numerical experience with multiple update quasi-Newton methods for unconstrained optimization ⋮ A diagonal quasi-Newton updating method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization ⋮ The global convergence of the BFGS method with a modified WWP line search for nonconvex functions ⋮ A Student-\(t\) full factor multivariate GARCH model ⋮ The regularization continuation method with an adaptive time step control for linearly constrained optimization problems ⋮ A modified nonmonotone BFGS algorithm for unconstrained optimization ⋮ The global convergence of a modified BFGS method for nonconvex functions ⋮ Stochastic quasi-Newton with line-search regularisation ⋮ The global convergence of the BFGS method under a modified Yuan-Wei-Lu line search technique ⋮ Multiscale design of nonlinear materials using reduced-order modeling ⋮ Detection of multiple complicated flaw clusters by dynamic variable-node XFEM with a three-step detection algorithm ⋮ New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method ⋮ A fast and accurate numerical approach for electromagnetic inversion ⋮ The projection technique for two open problems of unconstrained optimization problems

Cites Work

• A Class of Methods for Solving Nonlinear Simultaneous Equations
• A Rapidly Convergent Descent Method for Minimization
• A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
• Quasi-Newton Methods and their Application to Function Minimisation
• Quasi- Newton Methods for Nonlinear Equations
• A Family of Variable-Metric Methods Derived by Variational Means
• Optimal Conditioning of Quasi-Newton Methods
• A KDF9 ALGOL list-processing scheme

This page was built for publication: Conditioning of Quasi-Newton Methods for Function Minimization