Liu Tao-wen
Abstract
We first perturb the general semidefinte programming into a quadratic semidefinite programming,which,in its dual variable space,is equivalent to a linear projection equation.Then,we propose a class of projection and contraction methods for semidefinte programming and establish their global convergence.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We first perturb the general semidefinte programming into a quadratic semidefinite programming,which,in its dual variable space,is equivalent to a linear projection equation.Then,we propose a class of projection and contraction methods for semidefinte programming and establish their global convergence.
Key concepts: Semidefinite programming, Contraction (grammar), Quadratic programming, Projection (relational algebra), Mathematics, Mathematical optimization, Linear programming, Semidefinite embedding