Chen, Bilian

He, Simai

Li, Zhening

Zhang, Shuzhong

English

Name not available

Maximum block improvement and polynomial optimization

Portsmouth University Research Portal (Pure)

A new series of conjectures and open questions in optimization and matrix analysis,

A nonconvergent example for the iterative water-filling algorithm,

A polynomial based approach to extract the maxima of an antipodally symmetric spherical function and its application to extract fiber directions from the orientation distribution function in diffusion MRI,

A PTAS for the minimization of polynomials of fixed degree over the simplex, Theoretical Computer Science,

A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints,

A sum of squares approximation of nonnegative polynomials,

A tensor product matrix approximation problem in quantum physics, Linear Algebra and Its Applications,

Accelerated block-coordinate relaxation for regularized optimization, Working Paper,

Accelerating the Lee-Seung algorithm for nonnegative matrix factorization, preprint,

Algorithm 883: SparsePOP: A sparse semidefinite programming relaxation of polynomial optimization problems,

An enhanced line search scheme for complex-valued tensor decompositions,

Analysis of individual differences in multidimensional scaling via an N-way generalization of “Eckart-Young” decomposition,

Analysis of iterative waterfilling algorithm for multiuser power control in digital subscriber lines,

Approximation algorithms for discrete polynomial optimization,

Approximation algorithms for homogeneous polynomial optimization with quadratic constraints,

Biquadratic optimization over unit spheres and semidefinite programming relaxations,

Classical deterministic complexity of Edmonds’ problem and quantum entanglement,

Convergence of a block coordinate descent method for nondifferentiable minimization,

Convergent SDP relaxations in polynomial optimization with sparsity,

CVX: Matlab Software for Disciplined Convex Programming, version 1.2, http://cvxr.com/cvx,

Decompositions of a higher-order tensor in block terms—Part III: Alternating least squares algorithms,

Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems,

Eigenvalues and invariants of tensors,

Eigenvalues of a real supersymmetric tensor,

Enhanced line search: A novel method to accelerate PARAFAC,

Foundations of the PARAFAC procedure: Models and conditions for an “explanatory” multi-modal factor analysis,

General constrained polynomial optimization: an approximation approach,

Generalized normal forms and polynomial system solving.

Global optimization with polynomials and the problem of moments,

GloptiPoly 3: Moments, optimization and semidefinite programming,

GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi,

Interior-Point Polynomial Algorithms

Introducing SOSTOOLS: a general purpose sum of squares programming solver,

Linear equations modulo 2 and the L1 diameter of convex bodies,

Matlab Tensor Toolbox Version 2.4, http://csmr.ca.sandia.gov/~tgkolda/TensorToolbox,

Model-Based Control: Bridging Rigorous Theory and

Most tensor problems are NP

Multivariate polynomial minimization and its application in signal processing,

Network-Enabled Optimization Systems (NEOS) Server for Optimization,

New results on hermitian matrix rank-one decomposition.

New results on quadratic minimization,

Nonlinear Programming, second edition, Athena Scientific,

On cones of nonnegative quadratic functions,

On search directions for minimization algorithms,

On the best rank-1 and rank(R1, R2,

On the best rank-1 approximation of higher order supersymmetric tensors,

On the best rank-1 approximation to higher-order symmetric tensors,

On the convergence of the block nonlinear Gauss-Seidel method under convex constraints,

On the successive supersymmetric rank-1 decomposition of higher-order supersymmetric tensors,

On the use of homogeneous polynomials to develop anisotropic yield functions with applications to sheet forming,

Polynomial Optimization Problems—Approximation Algorithms and Applications, Ph.D. Thesis, The Chinese Univesrity of Hong Kong,

Polynomials and multilinear mappings in topological vector spaces,

Polynomials nonnegative on a grid and discrete representations,

Projected gradient methods for linearly constrained problems.

Random walk in a simplex and quadratic optimization over convex polytopes, CORE Discussion Paper,

Rank-one approximation to high order tensors,

SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones,

Semidefinite programming relaxations for semialgebraic problems,

Subdivision methods for solving polynomial equations,

Symmetric positive 4th order tensors & their estimation from diffusion weighted MRI,

Tensor decompositions and applications,

The complexity of optimizing over a simplex, hypercube or sphere: a short survey,

Z-eigenvalue methods for a global polynomial optimization problem,

https://researchportal.port.ac.uk/portal/services/downloadRegister/1711954/max_block_web.pdf

Maximum block improvement and polynomial optimization

Abstract

Similar works

Full text

Available Versions

Name not available

Portsmouth University Research Portal (Pure)