Reducing the bandwidth of a sparse matrix with a genetic algorithm

Author： Pop Petrică Matei Oliviu Comes Călin-Adrian

ISSN： 0233-1934

Source： Optimization, Vol.63, Iss.12, 2014-12, pp. : 1851-1876

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

Related content

A coordinate descent algorithm for sparse positive definite matrix estimation

STATISTICAL ANALYSIS AND DATA MINING (ELECTRONIC), Vol. 6, Iss. 5, 2013-10 ,pp. : 431-442

John Wiley & Sons Inc

Access to resources Recommend Favorite

A new sparse matrix vector multiplication graphics processing unit algorithm designed for finite element problems

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Vol. 102, Iss. 12, 2015-06 ,pp. : 1784-1814

John Wiley & Sons Inc

Access to resources Recommend Favorite

Logarithmic barriers for sparse matrix cones

By Andersen Martin S. Dahl Joachim Vandenberghe Lieven

Optimization Methods and Software, Vol. 28, Iss. 3, 2013-06 ,pp. : 396-423

Taylor & Francis Ltd

Access to resources Recommend Favorite

Preprocessing sparse semidefinite programs via matrix completion

By Fujisawa Katsuki Fukuda Mituhiro Nakata Kazuhide

Optimization Methods and Software, Vol. 21, Iss. 1, 2006-02 ,pp. : 17-39

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Frisch-Newton Algorithm for Sparse Quantile Regression

By Koenker Roger Ng Pin

Acta Mathematicae Applicatae Sinica, Vol. 21, Iss. 2, 2005-05 ,pp. : 225-236

Springer Publishing Company

Access to resources Recommend Favorite