Tensor Methods for Large, Sparse Unconstrained Optimization
From MaRDI portal
(Redirected from Publication:4377571)
Recommendations
- Tensor Methods for Unconstrained Optimization Using Second Derivatives
- Algorithm 765: STENMIN—a software package for large, sparse unconstrained optimization using tensor methods
- scientific article; zbMATH DE number 4128663
- Algorithm 738: a software package for unconstrained optimization using tensor methods
- Implementable tensor methods in unconstrained convex optimization
- scientific article; zbMATH DE number 3896207
- Tensor Methods for Large, Sparse Nonlinear Least Squares Problems
- Tensor Methods for Equality Constrained Optimization
Cited in
(25)- Tensor methods for full-information maximum likelihood estimation: Unconstrained estimation
- Tensor methods for solving symmetric \({\mathcal {M}}\)-tensor systems
- Tensor methods of full-information maximum likelihood estimation: Estimation with parameter constraints
- A proximal point like method for solving tensor least-squares problems
- Search for sparse solutions of super-large systems with a tensor structure
- On the optimization landscape of tensor decompositions
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization
- A curvilinear search algorithm for unconstrained optimization by automatic differentiation
- A modified tensor method for singular unconstrained optimization
- Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
- An adaptive conic trust-region method for unconstrained optimization
- Newton-based optimization for Kullback-Leibler nonnegative tensor factorizations
- Tensor Methods for Unconstrained Optimization Using Second Derivatives
- Algorithm 765: STENMIN—a software package for large, sparse unconstrained optimization using tensor methods
- Algorithm 738: a software package for unconstrained optimization using tensor methods
- Tensor Methods for Large, Sparse Nonlinear Least Squares Problems
- Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives
- Tensor Methods for Equality Constrained Optimization
- Tensor methods for minimizing convex functions with Hölder continuous higher-order derivatives
- scientific article; zbMATH DE number 7368657 (Why is no real title available?)
- A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
- Tensor methods for finding approximate stationary points of convex functions
- On high-order multilevel optimization strategies
- Analysis of a new BFGS algorithm and conjugate gradient algorithms and their applications in image restoration and machine learning
- A type of modified BFGS algorithm with any rank defects and the local Q-superlinear convergence properties
This page was built for publication: Tensor Methods for Large, Sparse Unconstrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377571)
