Results 51 to 60 of about 72 (70)
Complex Quadratic Optimization and Semidefinite Programming
. In this paper we study the approximation algorithms for a class of discrete quadratic optimization problems in the Hermitian complex form. A special case of the problem that we study corresponds to the max-3-cut model used in a recent paper of Goemans ...
Shuzhong Zhang, Yongwei Huang
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An algorithm for projecting a point onto a level set of a quadratic function
Optimization, 2022Wilfredo Sosa
exaly
New Results on Quadratic Minimization
SIAM Journal on Optimization, 2003Shuzhong Zhang, Yinyu Ye
exaly
Necessary and sufficient conditions for copositive tensors
Linear and Multilinear Algebra, 2015Liqun Qi, Song Y S
exaly
Proportioning with second-order information for model predictive control
Optimization Methods and Software, 2017Vladimir Havlena +2 more
exaly
An algorithm for quadratic ℓ1-regularized optimization with a flexible active-set strategy
Optimization Methods and Software, 2015Stefan Solntsev +2 more
exaly
The Convex Hull of a Quadratic Constraint over a Polytope
SIAM Journal on Optimization, 2020Asteroide Santana, Santanu S Dey
exaly

