The polyadic structure of factorable function tensors with applications to high-order minimization techniques
DOI10.1007/BF00938603zbMATH Open0583.90080MaRDI QIDQ1069447FDOQ1069447
R. H. Jackson, Garth P. McCormick
Publication date: 1986
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Halley's methodfactorable functionshigh-order minimization techniquesnth-order derivativestangent hyperbolas
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Algorithm for Separable Nonconvex Programming Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- On the Convergence of Halley's Method
- On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equation
- Automatic Differentiation of Computer Programs
- A simple automatic derivative evaluation program
- On Halley's Variation of Newton's Method
- A generalized Newton algorithm using higher-order derivatives
- A language for nonlinear programming problems
- Tangent Triangles to a Biquadratic Curve
- On Certain Formulae for Numerical Approximation
Cited In (12)
- A new framework for the computation of Hessians
- Theoretical efficiency of a new inexact method of tangent hyperbolas
- Theoretical efficiency of a new inexact method of tangent hyperbolas
- Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition
- New approach to global minimization of normal multivariate polynomial based on tensor
- Second-order sensitivity analysis in factorable programming: Theory and applications
- Automatic differentiation of the vector that solves a parametric linear system
- On the Halley class of methods for unconstrainedoptimization problems
- An interior point method for general large-scale quadratic programming problems
- Optimizing over three-dimensional subspaces in an interior-point method for linear programming
- Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation
- Optimization with unary functions
Recommendations
- Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-\((L_r,L_r,1)\) terms, and a new generalization 👍 👎
- On multivariate polynomial matrix factorization problems 👍 👎
- Computing the polyadic decomposition of nonnegative third order tensors 👍 👎
- High-order sum-of-squares structured tensors: theory and applications 👍 👎
- Some advances in tensor analysis and polynomial optimization 👍 👎
- Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives 👍 👎
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization 👍 👎
- Probabilistic Tensor Canonical Polyadic Decomposition With Orthogonal Factors 👍 👎
- An Optimal High-Order Tensor Method for Convex Optimization 👍 👎
- Structured tensor tuples to polynomial complementarity problems 👍 👎
This page was built for publication: The polyadic structure of factorable function tensors with applications to high-order minimization techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069447)
