Sizing and Least-Change Secant Methods
From MaRDI portal
Recommendations
- An All-Inclusive Efficient Region of Updates for Least Change Secant Methods
- scientific article; zbMATH DE number 3932310
- scientific article; zbMATH DE number 4109980
- On Least-Change Secant Updates in Factored Form
- On the Relation between Two Local Convergence Theories of Least-Change Secant Update Methods
Cited in
(74)- Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions
- Applications of semidefinite programming
- A numerical study of optimized sparse preconditioners
- A new adaptive Barzilai and Borwein method for unconstrained optimization
- Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization
- Global convergence property of scaled two-step BFGS method
- Accumulative approach in multistep diagonal gradient-type method for large-scale unconstrained optimization
- A structured quasi-Newton algorithm with nonmonotone search strategy for structured NLS problems and its application in robotic motion control
- Diagonal BFGS updates and applications to the limited memory BFGS method
- Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model
- Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
- Diagonal approximation of the Hessian by finite differences for unconstrained optimization
- New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method
- Diagonal quasi-Newton methods via least change updating principle with weighted Frobenius norm
- Accelerated diagonal gradient-type method for large-scale unconstrained optimization
- A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization
- A diagonal quasi-Newton updating method for unconstrained optimization
- A Bregman extension of quasi-Newton updates. II: Analysis of robustness properties
- Approximate Toeplitz matrix problem using semidefinite programming
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
- The global convergence of self-scaling BFGS algorithm with non-monotone line search for unconstrained nonconvex optimization problems
- Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization
- Diagonal quasi-Newton method via variational principle under generalized Frobenius norm
- Scaling damped limited-memory updates for unconstrained optimization
- Structured symmetric rank-one method for unconstrained optimization
- On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems
- On Least-Change Secant Updates in Factored Form
- scientific article; zbMATH DE number 4109980 (Why is no real title available?)
- On the Relation between Two Local Convergence Theories of Least-Change Secant Update Methods
- A low memory solver for integral equations of Chandrasekhar type in the radiative transfer problems
- Least change properties of ABS methods and their application in secant-type updates
- A two-step matrix-free secant method for solving large-scale systems of nonlinear equations
- A diagonal quasi-Newton updating method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
- Solving polynomial systems using a fast adaptive back propagation-type neural network algorithm
- On Sizing and Shifting the BFGS Update within the Sized-Broyden Family of Secant Updates
- An All-Inclusive Efficient Region of Updates for Least Change Secant Methods
- On measure functions for the self-scaling updating formulae for quasi-newton methods∗
- An Optimal Broyden Updating Formula And Its Application To Nonliner Least Squares
- A class of diagonal preconditioners for limited memory BFGS method
- A class of diagonal quasi-Newton methods for large-scale convex minimization
- A new accelerated diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization
- A robust algorithm for semidefinite programming
- Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods
- A new diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization
- Solving semidefinite programs using preconditioned conjugate gradients
- Convergence analysis of the self-dual optimally conditioned ssvm method of oren-spedicato
- An adaptive learning rate backpropagation-type neural network for solving \(n\times n\) systems on nonlinear algebraic equations
- An overview of stochastic quasi-Newton methods for large-scale machine learning
- A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM
- A new version of augmented self-scaling BFGS method
- Improved Hessian approximation with modified secant equations for symmetric rank-one method
- A restarting approach for the symmetric rank one update for unconstrained optimization
- An improved multi-step gradient-type method for large scale optimization
- A symmetric rank-one method based on extra updating techniques for unconstrained optimization
- A new self-scaling memoryless quasi-Newton update for unconstrained optimization
- A matrix-free quasi-Newton method for solving large-scale nonlinear systems
- Correction of nonmonotone trust region algorithm based on a modified diagonal regularized quasi-Newton method
- A new diagonal quasi-Newton algorithm for unconstrained optimization problems.
- A diagonal quasi-Newton method with modified BFGS update for nonconvex multiobjective optimization
- Analysis of a self-scaling quasi-Newton method
- Solving an augmented nonnegative matrix factorization model by modified scaled nonmonotone memoryless BFGS methods devised based on the ellipsoid vector norm
- The indefinite proximal gradient method
- A diagonal quasi-Newton method based on automatic differentiation for nonlinear equations
- Memoryless quasi-Newton-type methods via some weak secant relations for large-scale unconstrained optimization
- On solving a revised model of the nonnegative matrix factorization problem by the modified adaptive versions of the Dai-Liao method
- The -condition number: applications to preconditioning and low rank generalized Jacobian updating
- Adjustment of the scaling parameter of Dai-Kou type conjugate gradient methods with application to motion control.
- Scaled memoryless symmetric rank one method for large-scale optimization
- A proximal modified quasi-Newton method for nonsmooth regularized optimization
- Connecting Kaporin's condition number and the Bregman log determinant divergence
- A dynamically nonmonotone trust region algorithm based on scalar estimations of the Hessian with application to binary classification with outliers
- A stable primal-dual approach for linear programming under nondegeneracy assumptions
- Solving Hankel matrix approximation problem using semidefinite programming
- A generalized computing paradigm based on artificial dynamic models for mathematical programming
This page was built for publication: Sizing and Least-Change Secant Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142629)
