Pages that link to "Item:Q4110808"

The following pages link to Optimal conditioning of self-scaling variable Metric algorithms (Q4110808):

Displaying 50 items.

• New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method (Q2190791) (← links)
• A double parameter self-scaling memoryless BFGS method for unconstrained optimization (Q2190850) (← links)
• A modified scaled memoryless symmetric rank-one method (Q2193423) (← links)
• Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing (Q2243965) (← links)
• Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q2267641) (← links)
• An adaptive family of projection methods for constrained monotone nonlinear equations with applications (Q2279399) (← links)
• Superlinear convergence of nonlinear conjugate gradient method and scaled memoryless BFGS method based on assumptions about the initial point (Q2287573) (← links)
• Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update (Q2359995) (← links)
• A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization (Q2441364) (← links)
• A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update (Q2628174) (← links)
• Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization (Q2641222) (← links)
• The global convergence of self-scaling BFGS algorithm with non-monotone line search for unconstrained nonconvex optimization problems (Q2644350) (← links)
• Computational experiments with scaled initial hessian approximation for the broyden family methods^∗ (Q2709452) (← links)
• Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems (Q2926061) (← links)
• (Q3203937) (← links)
• Wide interval for efficient self-scaling quasi-Newton algorithms (Q3369519) (← links)
• A scaled nonlinear conjugate gradient algorithm for unconstrained optimization (Q3514834) (← links)
• L-Broyden methods: a generalization of the L-BFGS method to the limited-memory Broyden family (Q3630033) (← links)
• QN-like variable storage conjugate gradients (Q3668748) (← links)
• A fast and robust unconstrained optimization method requiring minimum storage (Q3693274) (← links)
• Matrix conditioning and nonlinear optimization (Q4147882) (← links)
• An assessment of two approaches to variable metric methods (Q4147886) (← links)
• On a conjecture of Dixon and other topics in variable metric methods (Q4181904) (← links)
• Optimal conditioning in the convex class of rank two updates (Q4187601) (← links)
• A class of self-dual updating formulae in the broyden family (Q4340166) (← links)
• An adaptive nonmonotone trust region algorithm (Q4622885) (← links)
• Low rank updates in preconditioning the saddle point systems arising from data assimilation problems (Q4638911) (← links)
• Computational experience with bank-one positive definite quasi-newton algorithms (Q4723579) (← links)
• On measure functions for the self-scaling updating formulae for quasi-newton methods^∗ (Q4764589) (← links)
• An Optimal Broyden Updating Formula And Its Application To Nonliner Least Squares (Q4859826) (← links)
• Erratum to: Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q4924112) (← links)
• A class of diagonal preconditioners for limited memory BFGS method (Q4924122) (← links)
• A hybrid scaling parameter for the scaled memoryless BFGS method based on the ℓ_∞ matrix norm (Q5031718) (← links)
• New Basic Hessian Approximations for Large-Scale Nonlinear Least-Squares Optimization (Q5117309) (← links)
• A new accelerated diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization (Q5151541) (← links)
• An adaptive nonmonotone trust region method based on a modified scalar approximation of the Hessian in the successive quadratic subproblems (Q5242267) (← links)
• Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q5436920) (← links)
• Convergence analysis of the self-dual optimally conditioned ssvm method of oren-spedicato (Q5689836) (← links)
• On the behaviour of a combined extra-updating/self-scaling BFGS method (Q5946739) (← links)
• An Accelerated Three-Term Extension of a Descent Nonlinear Conjugate Gradient Method (Q6053540) (← links)
• A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications (Q6093343) (← links)
• Eigenvalue analyses on the memoryless Davidon-Fletcher-Powell method based on a spectral secant equation (Q6142074) (← links)
• A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM (Q6142230) (← links)
• A descent family of the spectral Hestenes–Stiefel method by considering the quasi-Newton method (Q6175562) (← links)
• An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions (Q6175564) (← links)
• A diagonally scaled Newton-type proximal method for minimization of the models with nonsmooth composite cost functions (Q6184788) (← links)
• (Q6191840) (← links)
• On two symmetric Dai-Kou type schemes for constrained monotone equations with image recovery application (Q6491321) (← links)
• A new self-scaling memoryless quasi-Newton update for unconstrained optimization (Q6564739) (← links)
• Two efficient spectral hybrid CG methods based on memoryless BFGS direction and Dai–Liao conjugacy condition (Q6661117) (← links)