Skip to main navigation
Skip to search
Skip to main content
the Research Portal - University of Namur Home
English
Français
Home
Profiles
Research units
Projects
Research output
Student theses
Equipment
Datasets
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
Recognizing underlying sparsity in optimization
S. Kim, M. Kojima,
P. Toint
Research output
:
Contribution to journal
›
Article
›
peer-review
58
Downloads (Pure)
Overview
Fingerprint
Projects
(1)
Fingerprint
Dive into the research topics of 'Recognizing underlying sparsity in optimization'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
INIS
optimization
100%
space
50%
matrices
50%
relaxation
50%
algorithms
25%
efficiency
25%
performance
25%
vectors
25%
nonlinear problems
25%
transformations
25%
programming
25%
polynomials
25%
Keyphrases
Linear Transformation
25%
Relaxation Method
25%
Greedy Algorithm
25%
Combinatorial Optimization Problem
25%
Iterated Greedy Heuristic
25%
Problem Function
25%
Semidefinite Relaxation
25%
Preprocessor
25%
Number of Zeros
25%
Polynomial Optimization Problem
25%
Sparsity Structure
25%
Hidden Sparsity
25%
Engineering
Greedy Algorithm
16%
Preprocessor
16%
Linear Transformation
16%