Tensor Methods for Large, Sparse Unconstrained Optimization

DOI10.1137/S1052623494267723zbMATH Open0893.65042MaRDI QIDQ4377571FDOQ4377571

Publication date: 10 February 1998

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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

numerical examples unconstrained optimization Newton method trust region method large-scale optimization singular problems tensor methods sparse problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Cited In (22)

Search for sparse solutions of super-large systems with a tensor structure
A curvilinear search algorithm for unconstrained optimization by automatic differentiation
A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
On the optimization landscape of tensor decompositions
Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives
Tensor Methods for Large, Sparse Nonlinear Least Squares Problems
A type of modified BFGS algorithm with any rank defects and the local \(Q\)-superlinear convergence properties
Tensor methods for solving symmetric \({\mathcal {M}}\)-tensor systems
A modified tensor method for singular unconstrained optimization
Tensor Methods for Equality Constrained Optimization
Title not available (Why is that?)
On high-order multilevel optimization strategies
Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
Tensor methods for minimizing convex functions with Hölder continuous higher-order derivatives
Newton-based optimization for Kullback-Leibler nonnegative tensor factorizations
An adaptive conic trust-region method for unconstrained optimization
Tensor methods for full-information maximum likelihood estimation: Unconstrained estimation
A proximal point like method for solving tensor least-squares problems
Tensor methods of full-information maximum likelihood estimation: Estimation with parameter constraints
An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization
Tensor methods for finding approximate stationary points of convex functions
Tensor Methods for Unconstrained Optimization Using Second Derivatives

Uses Software

TENSOLVE

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)