The polyadic structure of factorable function tensors with applications to high-order minimization techniques
type: Item
instance of: scholarly article
title: The polyadic structure of factorable function tensors with applications to high-order minimization techniques
zbMATH Open document ID: 0583.90080
DOI: 10.1007/BF00938603
published in: Journal of Optimization Theory and Applications
publication date: 1986-01-01T00:00:00Z
review text: Factorable functions are shown to have arrays of Nth-order derivatives (tensors) which are naturally computed as sums of generalized outer product matrices (polyads). The computational implications of this for high-order minimization techniques (such as Halley's method of tangent hyperbolas) are investigated. A direct derivation of these high-order techniques is also given.
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3934785
zbMATH Keywords: factorable functions
zbMATH Keywords: nth-order derivatives
zbMATH Keywords: high-order minimization techniques
zbMATH Keywords: Halley's method
zbMATH Keywords: tangent hyperbolas
author: R. H. Jackson
author: Garth P. McCormick
MaRDI profile type: Publication
cites work: Q3677502
cites work: A language for nonlinear programming problems
cites work: Automatic Differentiation of Computer Programs
cites work: Q3881909
cites work: A simple automatic derivative evaluation program
cites work: Q5588268
cites work: Q3675433
cites work: A generalized Newton algorithm using higher-order derivatives
cites work: Q5732060
cites work: Q5652137
cites work: Q3843892
cites work: On the Convergence of Halley's Method
cites work: Tangent Triangles to a Biquadratic Curve
cites work: On Certain Formulae for Numerical Approximation
cites work: On Halley's Variation of Newton's Method
cites work: Q3843891
cites work: Q5671254
cites work: On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equation
cites work: An Algorithm for Separable Nonconvex Programming Problems
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
Recommended article: Some advances in tensor analysis and polynomial optimization
Recommended article: Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives
Recommended article: An Optimal High-Order Tensor Method for Convex Optimization
Recommended article: Structured tensor tuples to polynomial complementarity problems
Recommended article: Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-\((L_r,L_r,1)\) terms, and a new generalization
Recommended article: On multivariate polynomial matrix factorization problems
Recommended article: High-order sum-of-squares structured tensors: theory and applications
Recommended article: Probabilistic Tensor Canonical Polyadic Decomposition With Orthogonal Factors
Recommended article: Computing the polyadic decomposition of nonnegative third order tensors
Recommended article: Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
description: scientific article; zbMATH DE number 3934785