Computational enhancements in low-rank semidefinite programming

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.21, Iss.3, 2006-06, pp. : 493-512

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Embedding methods for semidefinite programming

By Zhang Qinghong

Optimization Methods and Software, Vol. 27, Iss. 3, 2012-06 ,pp. : 461-482

Taylor & Francis Ltd

Access to resources Recommend Favorite

Optimality Conditions in Semidefinite Programming

By Penot Jean-Paul

Numerical Functional Analysis and Optimization, Vol. 35, Iss. 7-9, 2014-07 ,pp. : 1174-1196

Taylor & Francis Ltd

Access to resources Recommend Favorite

A projector-splitting integrator for dynamical low-rank approximation

By Lubich Christian Oseledets Ivan

Bit Numerical Mathematics, Vol. 54, Iss. 1, 2014-03 ,pp. : 171-188

Springer Publishing Company

Access to resources Recommend Favorite

Low‐rank approximation of tensors via sparse optimization

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS (ELECTRONIC), Vol. 25, Iss. 2, 2018-03 ,pp. : n/a-n/a

John Wiley & Sons Inc

Access to resources Recommend Favorite

The trust region subproblem and semidefinite programming

By Fortin Charles Wolkowicz Henry

Optimization Methods and Software, Vol. 19, Iss. 1, 2004-02 ,pp. : 41-67

Taylor & Francis Ltd

Access to resources Recommend Favorite