Variable metric methods for unconstrained optimization and nonlinear least squares
From MaRDI portal
Publication:1593813
This is a review of variable metric methods for unconstrained optimization. A particular attention is focused on the derivation of formulas and their efficient implementation. Suggestions are given based on the authors' numerical experience.
Cites work
- A bound to the condition number of canonical rank-two corrections and applications to the variable metric method
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- A class of rank-one positive definite qnasi-newton updates for unconstrained minimization2
- A combined conjugate-gradient quasi-Newton minimization algorithm
- A Family of Variable-Metric Methods Derived by Variational Means
- A Formulation of Variable Metric Methods
- A New Algorithm for Unconstrained Optimization
- A new approach to symmetric rank-one updating
- A new approach to variable metric algorithms
- A New Variational Result for Quasi-Newton Formulae
- A Note on Minimization Algorithms which make Use of Non-quardratic Properties of the Objective Function
- A quasi-Newton method with modification of one column per iteration
- A Rapidly Convergent Descent Method for Minimization
- An Adaptive Nonlinear Least-Squares Algorithm
- An All-Inclusive Efficient Region of Updates for Least Change Secant Methods
- An Optimal Positive Definite Update for Sparse Hessian Matrices
- Analysis of a self-scaling quasi-Newton method
- Computational experience with known variable metric updates
- Conditioning of Quasi-Newton Methods for Function Minimization
- Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
- Estimation of sparse hessian matrices and graph coloring problems
- Factorized quasi-Newton methods for nonlinear least squares problems
- Function minimization by conjugate gradients
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- scientific article; zbMATH DE number 4180681 (Why is no real title available?)
- scientific article; zbMATH DE number 3843081 (Why is no real title available?)
- scientific article; zbMATH DE number 4147424 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 3741295 (Why is no real title available?)
- scientific article; zbMATH DE number 45283 (Why is no real title available?)
- scientific article; zbMATH DE number 193993 (Why is no real title available?)
- scientific article; zbMATH DE number 3496926 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 721769 (Why is no real title available?)
- scientific article; zbMATH DE number 3433447 (Why is no real title available?)
- scientific article; zbMATH DE number 1552870 (Why is no real title available?)
- scientific article; zbMATH DE number 766480 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- Hybrid methods for large sparse nonlinear least squares
- Hybrid Methods for Nonlinear Least Squares
- Iterative Solution Methods
- Limited-Memory Reduced-Hessian Methods for Large-Scale Unconstrained Optimization
- Local and superlinear convergence for truncated iterated projections methods
- Local convergence analysis for partitioned quasi-Newton updates
- Matrix conditioning and nonlinear optimization
- Measures for Symmetric Rank-One Updates
- Methods for Computing and Modifying the LDV Factors of a Matrix
- Methods of conjugate gradients for solving linear systems
- Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function
- Multi-step quasi-Newton methods for optimization
- New quasi-Newton equation and related methods for unconstrained optimization
- On Large Scale Nonlinear Least Squares Calculations
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- On the Behavior of Broyden’s Class of Quasi-Newton Methods
- On the global convergence of trust region algorithms for unconstrained minimization
- On the limited memory BFGS method for large scale optimization
- On the Use of Product Structure in Secant Methods for Nonlinear Least Squares Problems
- On variable-metric algorithms
- Optimal conditioning of self-scaling variable Metric algorithms
- Optimally conditioned optimization algorithms without line searches
- Partitioned variable metric updates for large structured optimization problems
- QN-like variable storage conjugate gradients
- Quasi-newton algorithms generate identical points
- Representations of quasi-Newton matrices and their use in limited memory methods
- Self-Scaling Variable Metric (SSVM) Algorithms
- Sizing the BFGS and DFP updates: Numerical study
- Solving the nonlinear least square problem: Application of a general method
- Some numerical experiments with variable-storage quasi-Newton algorithms
- Stability of Huang's update for the conjugate gradient method
- Technical Note—A Modified Conjugate Gradient Algorithm
- Testing Unconstrained Optimization Software
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- The estimation of the hessian matrix in nonlinear least squares problems with non-zero residuals
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Unified approach to quadratically convergent algorithms for function minimization
- Updating Quasi-Newton Matrices with Limited Storage
- Variational Methods for Non-Linear Least-Squares
- Variations on Variable-Metric Methods
Cited in
(27)- A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions
- Two limited-memory optimization methods with minimum violation of the previous secant conditions
- Nonsmoothness and a variable metric method
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- A conjugate directions approach to improve the limited-memory BFGS method
- Shifted limited-memory variable metric methods for large-scale unconstrained optimization
- Variable metric inexact line-search-based methods for nonsmooth optimization
- Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems
- A modified limited-memory BNS method for unconstrained minimization based on the conjugate directions idea
- Primal interior point method for minimization of generalized minimax functions
- scientific article; zbMATH DE number 4180681 (Why is no real title available?)
- On calibration of stochastic and fractional stochastic volatility models
- scientific article; zbMATH DE number 3852805 (Why is no real title available?)
- scientific article; zbMATH DE number 4156217 (Why is no real title available?)
- Primal interior-point method for large sparse minimax optimization
- Variational Methods for Non-Linear Least-Squares
- scientific article; zbMATH DE number 4011810 (Why is no real title available?)
- scientific article; zbMATH DE number 4041642 (Why is no real title available?)
- scientific article; zbMATH DE number 1293853 (Why is no real title available?)
- A combined class of self-scaling and modified quasi-Newton methods
- A structured quasi-Newton algorithm for optimizing with incomplete Hessian information
- Inexact variable metric method for convex-constrained optimization problems
- scientific article; zbMATH DE number 6176035 (Why is no real title available?)
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Adaptive control using stochastic approach for unknown but bounded disturbances and its application in balancing control
- Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization
- A variable metric method for nonsmooth convex constrained optimization
This page was built for publication: Variable metric methods for unconstrained optimization and nonlinear least squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1593813)
