Algorithm 896: LSA: algorithms for large-scale optimization
From MaRDI portal
Publication:2989073
large-scale optimizationquasi-Newton methodslimited-memory methodslarge-scale systems of nonlinear equationssparse problemsdiscrete Newton methodslarge-scale nonlinear least squareslarge-scale nonlinear minimaxlarge-scale nonsmooth optimizationpartially separable problemsprimal interior-point methods
Recommendations
Cited in
(11)- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method
- Fortran subroutines for network flow optimization using an interior point algorithm
- On the behaviour of constrained optimization methods when Lagrange multipliers do not exist
- Two limited-memory optimization methods with minimum violation of the previous secant conditions
- A modified limited-memory BNS method for unconstrained minimization based on the conjugate directions idea
- Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization
- A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions
- LSA
- Algorithm 811: NDA
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- scientific article; zbMATH DE number 3912130 (Why is no real title available?)
This page was built for publication: Algorithm 896: LSA: algorithms for large-scale optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989073)