Algorithm 765: STENMIN—a software package for large, sparse unconstrained optimization using tensor methods

DOI10.1145/244768.244788zbMATH Open0887.65066OpenAlexW2028055012WikidataQ113310345 ScholiaQ113310345MaRDI QIDQ4371124FDOQ4371124

Authors: Ali Bouaricha 

Publication date: 25 May 1998

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1997-23/

Recommendations

• Algorithm 738: a software package for unconstrained optimization using tensor methods
• Tensor Methods for Large, Sparse Unconstrained Optimization
• Tensor Methods for Unconstrained Optimization Using Second Derivatives
• Tensor methods for large sparse systems of nonlinear equations

zbMATH Keywords

unconstrained optimizationtensor methodrank-deficient matriceslarge, sparse optimization problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Packaged methods for numerical algorithms (65Y15) Nonlinear programming (90C30)

Cited In (4)

• A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
• STENMIN
• Algorithm 711: BTN: software for parallel unconstrained optimization
• Tensor Methods for Large, Sparse Unconstrained Optimization

Uses Software

• TENSOLVE
• CUTEr
• Algorithm 739

This page was built for publication: Algorithm 765: STENMIN—a software package for large, sparse unconstrained optimization using tensor methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371124)