Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem. Computational Optimization and Applications, 63, 333-364.

can be solved by solving an equivalent linear complementarity problem when H is positive semidefinite. The approach is outlined in the discussion of the LCP subroutine in Chapter 17, "Language ...

Abstract: This paper addresses the time-varying complex-valued quadratic programming problem by designing a fuzzy adaptive complex-valued zeroing neural network (FACZNN) with fuzzy control factors.

This paper proposes an exact method to solve an integer indefinite quadratic bilevel problem with multiple objectives at the upper level, where the objective functions at both levels are a product of ...

Abstract: This paper considers a market-making hedging problem with real market demands. To minimize multi-day hedging error square, a procedure based on dynamic ...