Zero Duality Gap in Quadratically Constrained Quadratic Programming
Saved in:
Date: | 2017 |
---|---|
Main Author: | O. A. Berezovskij |
Format: | Article |
Language: | English |
Published: |
2017
|
Series: | Mathematical and computer modelling. Series: Physical and mathematical sciences |
Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000813930 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Journal Title: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNASSimilar Items
-
On an estimate for quadratic optimization separable minimax problem
by: O. A. Berezovskij
Published: (2019) -
Dual quadratic estimate for linear complementarity problem
by: O. A. Berezovskij, et al.
Published: (2017) -
Exactness criteria for SDP-relaxations of quadratic extremum problems
by: O. A. Berezovskij
Published: (2016) -
The condition of dual quadratic bounds accuracy in matrix form
by: O. A. Berezovskij
Published: (2015) -
Algorithms for solving a separable quadratic programming problem
by: P. I. Stetsiuk, et al.
Published: (2017)