Pages that link to "Item:Q607501"
From MaRDI portal
The following pages link to Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501):
Displaying 50 items.
- A feasible method for optimization with orthogonality constraints (Q101635) (← links)
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure (Q274079) (← links)
- Concepts and techniques of optimization on the sphere (Q287654) (← links)
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere (Q341317) (← links)
- Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
- Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints (Q481050) (← links)
- On local convexity of quadratic transformations (Q489135) (← links)
- On cones of nonnegative quartic forms (Q525602) (← links)
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems (Q644908) (← links)
- Alternating direction method for bi-quadratic programming (Q652699) (← links)
- Approximation algorithms for optimization of real-valued general conjugate complex forms (Q683722) (← links)
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres (Q721466) (← links)
- Approximation methods for complex polynomial optimization (Q742305) (← links)
- Global optimality conditions and optimization methods for constrained polynomial programming problems (Q1663418) (← links)
- Self-concordance is NP-hard (Q1675557) (← links)
- Two extremal problems related to orders (Q1702839) (← links)
- On solving biquadratic optimization via semidefinite relaxation (Q1935575) (← links)
- Linear operators and positive semidefiniteness of symmetric tensor spaces (Q2018916) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- Lower bounds for cubic optimization over the sphere (Q2031942) (← links)
- Shifted eigenvalue decomposition method for computing C-eigenvalues of a piezoelectric-type tensor (Q2052265) (← links)
- An efficient alternating minimization method for fourth degree polynomial optimization (Q2070363) (← links)
- Computing the largest C-eigenvalue of a tensor using convex relaxation (Q2115256) (← links)
- On approximation algorithm for orthogonal low-rank tensor approximation (Q2159448) (← links)
- Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors (Q2162522) (← links)
- On norm compression inequalities for partitioned block tensors (Q2174201) (← links)
- On decompositions and approximations of conjugate partial-symmetric tensors (Q2240646) (← links)
- A concise proof to the spectral and nuclear norm bounds through tensor partitions (Q2278368) (← links)
- On the tensor spectral \(p\)-norm and its dual norm via partitions (Q2307701) (← links)
- Maximization of homogeneous polynomials over the simplex and the sphere: structure, stability, and generic behavior (Q2420824) (← links)
- Properties and methods for finding the best rank-one approximation to higher-order tensors (Q2450904) (← links)
- Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations (Q2797107) (← links)
- Bounds on the Spectral Norm and the Nuclear Norm of a Tensor Based on Tensor Partitions (Q2827070) (← links)
- The cubic spherical optimization problems (Q2894517) (← links)
- On New Classes of Nonnegative Symmetric Tensors (Q2968174) (← links)
- Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems (Q3465242) (← links)
- Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints (Q4909732) (← links)
- The Epsilon-Alternating Least Squares for Orthogonal Low-Rank Tensor Approximation and Its Global Convergence (Q5146632) (← links)
- A Unifying Perron--Frobenius Theorem for Nonnegative Tensors via Multihomogeneous Maps (Q5237906) (← links)
- Probability Bounds for Polynomial Functions in Random Variables (Q5244874) (← links)
- Hardness and Approximation Results for <i>L<sub>p</sub></i>-Ball Constrained Homogeneous Polynomial Optimization Problems (Q5247613) (← links)
- On Orthogonal Tensors and Best Rank-One Approximation Ratio (Q5373918) (← links)
- Inhomogeneous polynomial optimization over a convex set: An approximation approach (Q5496212) (← links)
- Convergence analysis of a block improvement method for polynomial optimization over unit spheres (Q5739742) (← links)
- An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels (Q5746701) (← links)
- Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations (Q6045329) (← links)
- Nonlinear Perron--Frobenius Theorems for Nonnegative Tensors (Q6046291) (← links)
- The convergence properties of infeasible inexact proximal alternating linearized minimization (Q6074854) (← links)
- Practical approximation algorithms for \(\ell_1\)-regularized sparse rank-1 approximation to higher-order tensors (Q6124341) (← links)
- Variational Characterization of Monotone Nonlinear Eigenvector Problems and Geometry of Self-Consistent Field Iteration (Q6139650) (← links)
