Maximum block improvement and polynomial optimization
From MaRDI portal
Publication:2902871
DOI10.1137/110834524zbMATH Open1250.90069OpenAlexW2126381689WikidataQ84954070 ScholiaQ84954070MaRDI QIDQ2902871FDOQ2902871
Authors: Bilian Chen, Simai He, Zhening Li, Shuzhong 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
Recommendations
- On Convergence of the Maximum Block Improvement Method
- Convergence analysis of a block improvement method for polynomial optimization over unit spheres.
- A hybrid second-order method for homogenous polynomial optimization over unit sphere
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- A global optimization algorithm for a type of homogeneous polynomial optimization
Multilinear algebra, tensor calculus (15A69) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Decomposition methods (49M27)
Cited In (56)
- Approximation methods for complex polynomial optimization
- A note on Banach's results concerning homogeneous polynomials associated with nonnegative tensors
- Multilayer tensor factorization with applications to recommender systems
- Multivariate Temporal Point Process Regression
- Minimization of the maximum peak-to-peak gain: the general multiblock problem
- Alternating direction method of multipliers for real and complex polynomial optimization models
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
- A hybrid second-order method for homogenous polynomial optimization over unit sphere
- Convergence analysis of a block improvement method for polynomial optimization over unit spheres.
- Three hypergraph eigenvector centralities
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- On new classes of nonnegative symmetric tensors
- On Convergence of the Maximum Block Improvement Method
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
- On obtaining sparse semantic solutions for inverse problems, control, and neural network training
- Tensor decomposition for learning Gaussian mixtures from moments
- The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
- An efficient low complexity algorithm for box-constrained weighted maximin dispersion problem
- Lower bounds for cubic optimization over the sphere
- Optimization models for complex recovery block schemes
- Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices
- The optimization landscape for fitting a rank-2 tensor with a rank-1 tensor
- Embedding Learning
- Phase-only transmit beampattern design for large phased array antennas with multi-point nulling
- A new updating method for the damped mass-spring systems
- On Orthogonal Tensors and Best Rank-One Approximation Ratio
- Computational methods for solving nonconvex block-separable constrained quadratic problems
- Characterizing real-valued multivariate complex polynomials and their symmetric tensor representations
- Title not available (Why is that?)
- Tensor-on-Tensor Regression
- Riemannian Newton optimization methods for the symmetric tensor approximation problem
- Best rank one approximation of real symmetric tensors can be chosen symmetric
- On norm compression inequalities for partitioned block tensors
- On accelerating the regularized alternating least-squares algorithm for tensors
- Completely positive reformulations of polynomial optimization problems with linear constraints
- An efficient alternating minimization method for fourth degree polynomial optimization
- Iteration complexity analysis of block coordinate descent methods
- On optimal low rank Tucker approximation for tensors: the case for an adjustable core size
- A Riemannian trust region method for the canonical tensor rank approximation problem
- Smooth neighborhood recommender systems
- Individualized multilayer tensor learning with an application in imaging analysis
- Optimization of Block Size for CBFM in MoM
- Two-level monotonic multistage recommender systems
- Polynomial-time local-improvement algorithm for consecutive block minimization
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
- On Fully Real Eigenconfigurations of Tensors
- Greedy approaches to symmetric orthogonal tensor decomposition
- Title not available (Why is that?)
- Spectral norm of a symmetric tensor and its computation
- Properties and methods for finding the best rank-one approximation to higher-order tensors
- Approximation algorithms for discrete polynomial optimization
- Rank-1 tensor properties with applications to a class of tensor optimization problems
- 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
- A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors
Uses Software
This page was built for publication: Maximum block improvement and polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2902871)
