Alternating direction method for bi-quadratic programming
The authors investigate bi-quadratic programming problems (Bi-QP) as those studied by \textit{C. Ling, J. Nie, L. Qi} and \textit{Y. Ye} [SIAM J. Optim. 20, No. 3, 1286--1310 (2009; Zbl 1221.90074)], namely \[ \text{minimize}\quad \sum_{i=1}^m \sum_{j=1}^n \sum_{k=1}^m \sum_{l=1}^n b_{ijkl} x_i y_j x_k y_l\quad \text{s.t.} \quad \|x\|=1, \|y\|=1, \] where \(b_{ijkl}\) are real numbers for all \(i, k \in \{1,\dots,m\}\) and \(j, l \in \{1,\dots,n\}\), while \(x=(x_1,\dots,x_m)\) and \(y=(y_1,\dots,y_n)\) are vectors in the Euclidean spaces \((\mathbb{R}^m,\|\cdot\|)\) and \((\mathbb{R}^n,\|\cdot\|)\), respectively. By means of a reformulation of (Bi-QP), the authors introduce a quadratic semidefinite programming relaxation for (Bi-QP) and develop an alternating direction method for solving it. The convergence of the proposed method is established and numerical experiments are provided.
- Alternating direction method of multipliers for linear programming
- An alternating direction method for solving convex nonlinear semidefinite programming problems
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- An alternating directions method of multipliers for convex quadratic second-order cone programming
- Solving semidefinite programming problems via alternating direction methods
- An alternating direction numerical method for a class of inverse quadratic programming problems
- Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- Bi-parametric convex quadratic optimization
- The alternating-direction iterative method for saddle point problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- A new inexact alternating directions method for monotone variational inequalities
- A proximal-based deomposition method for compositions method for convex minimization problems
- A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints
- A variable-penalty alternating directions method for convex optimization
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Conditions for strong ellipticity and M-eigenvalues
- Conditions for strong ellipticity of anisotropic elastic materials
- scientific article; zbMATH DE number 425777 (Why is no real title available?)
- scientific article; zbMATH DE number 1047682 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- Independent component analysis, a new concept?
- Nondifferentiable optimization and polynomial problems
- On Cones of Nonnegative Quadratic Functions
- On the best rank-1 approximation of higher-order supersymmetric tensors
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Rank-one approximation to high order tensors
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
- Solving semidefinite programming problems via alternating direction methods
- Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
- Standard bi-quadratic optimization problems and unconstrained polynomial reformulations
- Topics in semidefinite and interior-point methods
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Bi-block positive semidefiniteness of bi-block symmetric tensors
- An efficient alternating minimization method for fourth degree polynomial optimization
- M-eigenvalue intervals and checkable sufficient conditions for the strong ellipticity
- Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints
- scientific article; zbMATH DE number 966589 (Why is no real title available?)
- A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors
- An entropy-regularized ADMM for binary quadratic programming
- Convergence analysis on the alternating direction method of multipliers for the cosparse optimization problem
- Tighter bound estimation for efficient biquadratic optimization over unit spheres
This page was built for publication: Alternating direction method for bi-quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652699)
