Pages that link to "Item:Q4060281"
From MaRDI portal
The following pages link to Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization (Q4060281):
Displaying 12 items.
- A faster modified Newton-Raphson iteration (Q1139975) (← links)
- Perspectives on self-scaling variable metric algorithms (Q1151823) (← links)
- Conditions for variable-metric algorithms to be conjugate-gradient algorithms (Q1173014) (← links)
- On quasi-Newton and pseudo-Newton algorithms (Q1220357) (← links)
- A nonlinear optimization approach to the construction of general linear methods of high order (Q1362409) (← links)
- An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules (Q1652386) (← links)
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization (Q2479826) (← links)
- A quasi-Newton-based floorplanner for fixed-outline floorplanning (Q2668641) (← links)
- On the selection of parameters in Self Scaling Variable Metric Algorithms (Q4051920) (← links)
- Optimal conditioning of self-scaling variable Metric algorithms (Q4110808) (← links)
- Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations (Q5886218) (← links)
- On the final steps of Newton and higher order methods (Q5963239) (← links)
