Maximum Block Improvement and Polynomial Optimization

From MaRDI portal
Publication:2902871

DOI10.1137/110834524zbMath1250.90069OpenAlexW2126381689WikidataQ84954070 ScholiaQ84954070MaRDI QIDQ2902871

Simai He, Zhening Li, Bilian Chen, Shu-Zhong Zhang

Publication date: 22 August 2012

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

Full work available at URL: https://doi.org/10.1137/110834524



Related Items

Embedding Learning, A note on Banach's results concerning homogeneous polynomials associated with nonnegative tensors, On obtaining sparse semantic solutions for inverse problems, control, and neural network training, Tensor decomposition for learning Gaussian mixtures from moments, On Fully Real Eigenconfigurations of Tensors, The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor, Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors, Phase-only transmit beampattern design for large phased array antennas with multi-point nulling, Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems, On norm compression inequalities for partitioned block tensors, Approximation algorithms for discrete polynomial optimization, Completely positive reformulations of polynomial optimization problems with linear constraints, Greedy Approaches to Symmetric Orthogonal Tensor Decomposition, A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors, Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices, Multivariate Temporal Point Process Regression, Unnamed Item, The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor, Extreme Ratio Between Spectral and Frobenius Norms of Nonnegative Tensors, Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual, Spectral norm of a symmetric tensor and its computation, Best rank one approximation of real symmetric tensors can be chosen symmetric, On New Classes of Nonnegative Symmetric Tensors, On Orthogonal Tensors and Best Rank-One Approximation Ratio, A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem, Individualized Multilayer Tensor Learning With an Application in Imaging Analysis, Properties and methods for finding the best rank-one approximation to higher-order tensors, The number of singular vector tuples and uniqueness of best rank-one approximation of tensors, On optimal low rank Tucker approximation for tensors: the case for an adjustable core size, On accelerating the regularized alternating least-squares algorithm for tensors, Multilayer tensor factorization with applications to recommender systems, Iteration complexity analysis of block coordinate descent methods, Alternating direction method of multipliers for real and complex polynomial optimization models, Tensor-on-Tensor Regression, A hybrid second-order method for homogenous polynomial optimization over unit sphere, Approximation algorithms for nonnegative polynomial optimization problems over unit spheres, An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem, Lower bounds for cubic optimization over the sphere, Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations, Approximation methods for complex polynomial optimization, Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems, A new updating method for the damped mass-spring systems, An efficient alternating minimization method for fourth degree polynomial optimization, Riemannian Newton optimization methods for the symmetric tensor approximation problem, Two-level monotonic multistage recommender systems, Inhomogeneous polynomial optimization over a convex set: An approximation approach, Unnamed Item, Unnamed Item, Three Hypergraph Eigenvector Centralities


Uses Software