The polyadic structure of factorable function tensors with applications to high-order minimization techniques
From MaRDI portal
(Redirected from Publication:1069447)
Recommendations
- Some advances in tensor analysis and polynomial optimization
- Tensor methods for minimizing convex functions with Hölder continuous higher-order derivatives
- An optimal high-order tensor method for convex optimization
- Structured tensor tuples to polynomial complementarity problems
- 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
- High-order sum-of-squares structured tensors: theory and applications
- Probabilistic Tensor Canonical Polyadic Decomposition With Orthogonal Factors
- Computing the polyadic decomposition of nonnegative third order tensors
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
Cites work
- scientific article; zbMATH DE number 3896207 (Why is no real title available?)
- scientific article; zbMATH DE number 3898606 (Why is no real title available?)
- scientific article; zbMATH DE number 3176370 (Why is no real title available?)
- scientific article; zbMATH DE number 3176371 (Why is no real title available?)
- scientific article; zbMATH DE number 3686799 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3405048 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- A generalized Newton algorithm using higher-order derivatives
- A language for nonlinear programming problems
- A simple automatic derivative evaluation program
- An Algorithm for Separable Nonconvex Programming Problems
- Automatic Differentiation of Computer Programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- On Certain Formulae for Numerical Approximation
- On Halley's Variation of Newton's Method
- 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
- Tangent Triangles to a Biquadratic Curve
Cited in
(12)- New approach to global minimization of normal multivariate polynomial based on tensor
- Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation
- An interior point method for general large-scale quadratic programming problems
- Second-order sensitivity analysis in factorable programming: Theory and applications
- Theoretical efficiency of a new inexact method of tangent hyperbolas
- On the Halley class of methods for unconstrained optimization problems
- Optimization with unary functions
- Theoretical efficiency of a new inexact method of tangent hyperbolas
- Optimizing over three-dimensional subspaces in an interior-point method for linear programming
- Automatic differentiation of the vector that solves a parametric linear system
- Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition
- A new framework for the computation of Hessians
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)
