Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
From MaRDI portal
Publication:2277145
Recommendations
- scientific article; zbMATH DE number 682565
- scientific article; zbMATH DE number 1180450
- Local andQ-superlinear convergence of a class of collinear scaling algorithms that extends quasi-newton methods with broyden's bounded-⊘ class of updates† ‡
- scientific article; zbMATH DE number 1150474
- A numerical evaluation of some collinear scaling algorithms for unconstrained
Cites work
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- Collinear scaling and sequential estimation in sparse optimization algorithms
- Conic Approximations and Collinear Scalings for Optimizers
- Convergence Theorems for Least-Change Secant Update Methods
- On statistical control of optimization
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- Quasi-Newton Methods, Motivation and Theory
- The Q-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization
Cited in
(28)- scientific article; zbMATH DE number 682565 (Why is no real title available?)
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- A quasi-Newton trust region method with a new conic model for the unconstrained optimization
- A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy
- A nonmonotone adaptive trust region method for unconstrained optimization based on conic model
- A nonmonotone trust-region method of conic model for unconstrained optimization
- A trust region method with a conic model for nonlinearly constrained optimization
- Some convergence properties of descent methods
- Interpolation by conic model for unconstrained optimization
- A trust-region method with a conic model for unconstrained optimization
- A note on line search termination criteria for collinear scaling algorithms
- A global optimization algorithm for sum of quadratic ratios problem with coefficients
- A model-hybrid approach for unconstrained optimization problems
- A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational results
- On the updating scheme in a class of collinear scaling algorithms for sparse minimization
- A subspace minimization conjugate gradient method based on conic model for unconstrained optimization
- On Davidon's collinear scaling algorithms for optimization
- A variant of trust-region methods for unconstrained optimization
- A fractional programming algorithm based on conic quasi-Newton trust region method for unconstrained minimization
- An adaptive conic trust-region method for unconstrained optimization
- Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem
- An improved hybrid quantum optimization algorithm for solving nonlinear equations
- A class of collinear scaling algorithms for bound-constrained optimization: convergence theorems
- Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization
- A new nonmonotone trust-region method of conic model for solving unconstrained optimization
- A nonmonotone conic trust region method based on line search for solving unconstrained optimization
- Local andQ-superlinear convergence of a class of collinear scaling algorithms that extends quasi-newton methods with broyden's bounded-⊘ class of updates† ‡
- A numerical evaluation of some collinear scaling algorithms for unconstrained
This page was built for publication: Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277145)
