Unified approach to quadratically convergent algorithms for function minimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3311344 (Why is no real title available?)
- scientific article; zbMATH DE number 3329468 (Why is no real title available?)
- A Rapidly Convergent Descent Method for Minimization
- Function minimization by conjugate gradients
- Memory gradient method for the minimization of functions
- Methods of conjugate gradients for solving linear systems
- Relation between the memory gradient method and the Fletcher-Reeves method
- Variable Metric Method for Minimization
Cited in
(55)- Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
- Nonlinear hybrid procedures and fixed point iterations
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- Cubic regularization in symmetric rank-1 quasi-Newton methods
- Variable metric methods in Hilbert space with applications to control problems
- Direct-prediction quasi-Newton methods in Hilbert space with applications to control problems
- Improved Hessian approximation with modified secant equations for symmetric rank-one method
- On variable-metric algorithms
- A Sparse Quasi-Newton Update Derived Variationally with a Nondiagonally Weighted Frobenius Norm
- Some notes on the quasi-Newton methods
- Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
- Stability of Huang's update for the conjugate gradient method
- A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization
- A double parameter self-scaling memoryless BFGS method for unconstrained optimization
- One class of dual matrix methods
- Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function
- Stochastic Steffensen method
- Unconstrained approach to the extremization of constrained functions
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems
- New approach to comparison of search methods used in nonlinear programming problems
- A variable metric-method for function minimization derived from invariancy to nonlinear scaling
- Two new conjugate gradient methods based on modified secant equations
- On exact linesearch quasi-Newton methods for minimizing a quadratic function
- Acoustic full-waveform inversion and its uncertainty estimation based on a vector-version square-root variable metric method
- Optimization of large-scale complex systems
- Least-squares solution of \(F=PG\) over positive semidefinite symmetric \(P\)
- Conditions for variable-metric algorithms to be conjugate-gradient algorithms
- Generalized conjugate directions for unconstrained function minimization
- Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming
- A class of one parameter conjugate gradient methods
- Eigenvalues and switching algorithms for Quasi-Newton updates
- A class of quadratically convergent algorithms for constrained function minimization
- Method of dual matrices for function minimization
- scientific article; zbMATH DE number 3511872 (Why is no real title available?)
- Variable metric methods for unconstrained optimization and nonlinear least squares
- A rational gradient model for minimization
- Quadratically convergent algorithms and one-dimensional search schemes
- Local and superlinear convergence of quasi-Newton methods based on modified secant conditions
- An approach for analyzing the global rate of convergence of quasi-Newton and truncated-Newton methods
- A parallel unconstrained quasi-Newton algorithm and its performance on a local memory parallel computer
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- Numerical experiments on DFP-method, a powerful function minimization technique
- On the Huang class of variable metric methods
- Suboptimal explicit receding horizon control via approximate multiparametric quadratic pro\-gramming
- Quasi Newton techniques generate identical points II: The proofs of four new theorems
- On the uniqueness of search directions in variable metric algorithms
- Numerical experiments on dual matrix algorithms for function minimization
- Some investigations about a unified approach to quadratically convergent algorithms for function minimization
- Direct prediction methods in Hilbert space with applications to control problems
- Approximation methods for the unconstrained optimization
- Unified approach to unconstrained minimization via basic matrix factorizations
- On the Local and Superlinear Convergence of a Parameterized DFP Method
- Numerical experiments on quadratically convergent algorithms for function minimization
This page was built for publication: Unified approach to quadratically convergent algorithms for function minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2535817)
