Standard bi-quadratic optimization problems and unconstrained polynomial reformulations
From MaRDI portal
Publication:427394
DOI10.1007/s10898-011-9710-5zbMath1268.90085OpenAlexW2160447507MaRDI QIDQ427394
Immanuel M. Bomze, Chen Ling, Xinzhen Zhang, Liqun Qi
Publication date: 13 June 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9710-5
Related Items (4)
A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure ⋮ Alternating direction method for bi-quadratic programming ⋮ Standard tensor and its applications in problem of singular values of tensors ⋮ Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game
Cites Work
- A first-order interior-point method for linearly constrained smooth optimization
- Ellipticity and deformations with discontinuous gradients in finite elastostatics
- A tensor product matrix approximation problem in quantum physics
- On global optimizations with polynomials
- Conditions for strong ellipticity of anisotropic elastic materials
- Conditions for strong ellipticity and M-eigenvalues
- On the ellipticity of the equations of nonlinear elastostatics for a special material
- Positive semidefinite biquadratic forms
- On standard quadratic optimization problems
- A GRASP for the biquadratic assignment problem
- A reformulation of the strong ellipticity conditions for unconstrained hyperelastic media
- New modified function method for global optimization
- Unconstrained formulation of standard quadratic optimization problems
- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
- Quartic formulation of standard quadratic optimization problems
- A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor
- A Conic Duality Frank–Wolfe-Type Theorem via Exact Penalization in Quadratic Optimization
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- A New and Efficient Algorithm for a Class of Portfolio Selection Problems
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Standard bi-quadratic optimization problems and unconstrained polynomial reformulations
