Pages that link to "Item:Q3142629"

The following pages link to Sizing and Least-Change Secant Methods (Q3142629):

Displaying 50 items.

• Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization (Q272601) (← links)
• Scaling damped limited-memory updates for unconstrained optimization (Q306311) (← links)
• On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems (Q356122) (← links)
• A low memory solver for integral equations of Chandrasekhar type in the radiative transfer problems (Q410401) (← links)
• A two-step matrix-free secant method for solving large-scale systems of nonlinear equations (Q442886) (← links)
• A class of diagonal quasi-Newton methods for large-scale convex minimization (Q503542) (← links)
• Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods (Q523183) (← links)
• Improved Hessian approximation with modified secant equations for symmetric rank-one method (Q629505) (← links)
• A restarting approach for the symmetric rank one update for unconstrained optimization (Q632383) (← links)
• An improved multi-step gradient-type method for large scale optimization (Q640533) (← links)
• A symmetric rank-one method based on extra updating techniques for unconstrained optimization (Q651495) (← links)
• A matrix-free quasi-Newton method for solving large-scale nonlinear systems (Q660887) (← links)
• Analysis of a self-scaling quasi-Newton method (Q689143) (← links)
• Scaled memoryless symmetric rank one method for large-scale optimization (Q720629) (← links)
• A stable primal-dual approach for linear programming under nondegeneracy assumptions (Q849092) (← links)
• Solving Hankel matrix approximation problem using semidefinite programming (Q875374) (← links)
• A generalized computing paradigm based on artificial dynamic models for mathematical programming (Q894649) (← links)
• Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions (Q1294553) (← links)
• Applications of semidefinite programming (Q1294557) (← links)
• A numerical study of optimized sparse preconditioners (Q1334989) (← links)
• A new adaptive Barzilai and Borwein method for unconstrained optimization (Q1653281) (← links)
• Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization (Q1713247) (← links)
• Global convergence property of scaled two-step BFGS method (Q1744145) (← links)
• Accumulative approach in multistep diagonal gradient-type method for large-scale unconstrained optimization (Q1760876) (← links)
• A structured quasi-Newton algorithm with nonmonotone search strategy for structured NLS problems and its application in robotic motion control (Q2029652) (← links)
• Diagonal BFGS updates and applications to the limited memory BFGS method (Q2114834) (← links)
• Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model (Q2165892) (← links)
• Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization (Q2171075) (← links)
• Diagonal approximation of the Hessian by finite differences for unconstrained optimization (Q2188948) (← links)
• New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method (Q2190791) (← links)
• Diagonal quasi-Newton methods via least change updating principle with weighted Frobenius norm (Q2225525) (← links)
• Accelerated diagonal gradient-type method for large-scale unconstrained optimization (Q2228737) (← links)
• A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization (Q2360814) (← links)
• A diagonal quasi-Newton updating method for unconstrained optimization (Q2420159) (← links)
• A Bregman extension of quasi-Newton updates. II: Analysis of robustness properties (Q2453184) (← links)
• Approximate Toeplitz matrix problem using semidefinite programming (Q2483033) (← links)
• Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming (Q2566758) (← links)
• The global convergence of self-scaling BFGS algorithm with non-monotone line search for unconstrained nonconvex optimization problems (Q2644350) (← links)
• Diagonal quasi-Newton method via variational principle under generalized Frobenius norm (Q2829584) (← links)
• Structured symmetric rank-one method for unconstrained optimization (Q3101645) (← links)
• Least change properties of ABS methods and their application in secant-type updates (Q4380562) (← links)
• A diagonal quasi-Newton updating method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization (Q4559412) (← links)
• Solving polynomial systems using a fast adaptive back propagation-type neural network algorithm (Q4575282) (← 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)
• A class of diagonal preconditioners for limited memory BFGS method (Q4924122) (← links)
• A new accelerated diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization (Q5151541) (← links)
• A robust algorithm for semidefinite programming (Q5200556) (← links)
• A New Diagonal Quasi-Newton Updating Method With Scaled Forward Finite Differences Directional Derivative for Unconstrained Optimization (Q5384612) (← links)
• Solving semidefinite programs using preconditioned conjugate gradients (Q5460654) (← links)