Variable metric methods for unconstrained optimization and nonlinear least squares
From MaRDI portal
Publication:1593813
DOI10.1016/S0377-0427(00)00420-9zbMath0985.65066OpenAlexW2057544288MaRDI QIDQ1593813
Emilio Spedicato, Ladislav Lukšan
Publication date: 2 June 2002
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(00)00420-9
unconstrained optimizationvariable metric methodsnonlinear least squaresmethods of quasi-Newton type
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Related Items
Unnamed Item, On calibration of stochastic and fractional stochastic volatility models, Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems, A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes, A modified limited-memory BNS method for unconstrained minimization based on the conjugate directions idea, Unnamed Item, A combined class of self-scaling and modified quasi-Newton methods, A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions, A conjugate directions approach to improve the limited-memory BFGS method, A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information, Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization, Unnamed Item, Two limited-memory optimization methods with minimum violation of the previous secant conditions, Shifted limited-memory variable metric methods for large-scale unconstrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of a self-scaling quasi-Newton method
- A quasi-Newton method with modification of one column per iteration
- Some numerical experiments with variable-storage quasi-Newton algorithms
- On the limited memory BFGS method for large scale optimization
- Convergence theory for the structured BFGS secant method with an application to nonlinear least squares
- Partitioned variable metric updates for large structured optimization problems
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- Factorized quasi-Newton methods for nonlinear least squares problems
- Solving the nonlinear least square problem: Application of a general method
- A bound to the condition number of canonical rank-two corrections and applications to the variable metric method
- New quasi-Newton equation and related methods for unconstrained optimization
- Sizing the BFGS and DFP updates: Numerical study
- Representations of quasi-Newton matrices and their use in limited memory methods
- Multi-step quasi-Newton methods for optimization
- Computational experience with known variable metric updates
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Local convergence analysis for partitioned quasi-Newton updates
- Hybrid methods for large sparse nonlinear least squares
- Unified approach to quadratically convergent algorithms for function minimization
- On variable-metric algorithms
- Stability of Huang's update for the conjugate gradient method
- Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
- Truncated-Newton algorithms for large-scale unconstrained optimization
- A Note on Minimization Algorithms which make Use of Non-quardratic Properties of the Objective Function
- Local and superlinear convergence for truncated iterated projections methods
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- QN-like variable storage conjugate gradients
- A class of rank-one positive definite qnasi-newton updates for unconstrained minimization2
- On the global convergence of trust region algorithms for unconstrained minimization
- Estimation of sparse hessian matrices and graph coloring problems
- Variational Methods for Non-Linear Least-Squares
- Hybrid Methods for Nonlinear Least Squares
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- Technical Note—A Modified Conjugate Gradient Algorithm
- Testing Unconstrained Optimization Software
- Updating Quasi-Newton Matrices with Limited Storage
- An Adaptive Nonlinear Least-Squares Algorithm
- On the Behavior of Broyden’s Class of Quasi-Newton Methods
- A New Variational Result for Quasi-Newton Formulae
- Self-Scaling Variable Metric (SSVM) Algorithms
- Optimally conditioned optimization algorithms without line searches
- Methods for Computing and Modifying the LDV Factors of a Matrix
- Optimal conditioning of self-scaling variable Metric algorithms
- The estimation of the hessian matrix in nonlinear least squares problems with non-zero residuals
- Matrix conditioning and nonlinear optimization
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- A combined conjugate-gradient quasi-Newton minimization algorithm
- On the Use of Product Structure in Secant Methods for Nonlinear Least Squares Problems
- Limited-Memory Reduced-Hessian Methods for Large-Scale Unconstrained Optimization
- Measures for Symmetric Rank-One Updates
- On Large Scale Nonlinear Least Squares Calculations
- An All-Inclusive Efficient Region of Updates for Least Change Secant Methods
- An Optimal Positive Definite Update for Sparse Hessian Matrices
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- Iterative Solution Methods
- A new approach to symmetric rank-one updating
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- A Rapidly Convergent Descent Method for Minimization
- Function minimization by conjugate gradients
- A Family of Variable-Metric Methods Derived by Variational Means
- Variations on Variable-Metric Methods
- A new approach to variable metric algorithms
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Conditioning of Quasi-Newton Methods for Function Minimization
- Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function
- A New Algorithm for Unconstrained Optimization
- Quasi-newton algorithms generate identical points
- A Formulation of Variable Metric Methods
- Methods of conjugate gradients for solving linear systems
