Alternating direction method for bi-quadratic programming
From MaRDI portal
Publication:652699
DOI10.1007/s10898-010-9635-4zbMath1248.65061OpenAlexW2016561744MaRDI QIDQ652699
Zheng-Hai Huang, Sheng-Long Hu
Publication date: 15 December 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9635-4
convergencenumerical experimentsalternating direction methodbi-quadratic programmingquadratic semidefinite programming relaxation
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Quadratic programming (90C20)
Related Items (max. 100)
M-eigenvalue intervals and checkable sufficient conditions for the strong ellipticity ⋮ A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors ⋮ Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints ⋮ Bi-block positive semidefiniteness of bi-block symmetric tensors ⋮ An efficient alternating minimization method for fourth degree polynomial optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Standard bi-quadratic optimization problems and unconstrained polynomial reformulations
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
- Conditions for strong ellipticity of anisotropic elastic materials
- Conditions for strong ellipticity and M-eigenvalues
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A variable-penalty alternating directions method for convex optimization
- Independent component analysis, a new concept?
- A proximal-based deomposition method for compositions method for convex minimization problems
- Nondifferentiable optimization and polynomial problems
- Topics in semidefinite and interior-point methods
- A new inexact alternating directions method for monotone variational inequalities
- Solving semidefinite programming problems via alternating direction methods
- Rank-One Approximation to High Order Tensors
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- On Cones of Nonnegative Quadratic Functions
- Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
This page was built for publication: Alternating direction method for bi-quadratic programming
