Skip to main navigation
Skip to search
Skip to main content
PolyU Scholars Hub Home
Help & FAQ
Link opens in a new tab
Search content at PolyU Scholars Hub
Home
Researchers
Units
Research output
Prizes
Activities
Press/Media
Student theses
A quadratic penalty method for hypergraph matching
Chunfeng Cui
, Qingna Li
, Liqun Qi
, Hong Yan
Department of Applied Mathematics
The Hong Kong Polytechnic University
Research output
:
Journal article publication
›
Journal article
›
Academic research
›
peer-review
6
Link opens in a new tab
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A quadratic penalty method for hypergraph matching'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Quadratic Penalty Method
100%
Hypergraph Matching
100%
Global Minimizer
60%
Support Set
60%
Original Problem
40%
Matching Problem
40%
Sparse Constraint
40%
Relaxed Problem
40%
Numerical Results
20%
Computer Vision
20%
Constrained Optimization Problem
20%
Number of Iterations
20%
CPU Time
20%
Gradient Projection
20%
Quadratic Penalty
20%
Exact Recovery
20%
Assignment Constraints
20%
Mathematics
Hypergraphs
100%
Penalty Method
100%
Global Minimizer
60%
Matching Problem
40%
Objective Function
20%
Polynomial
20%
Projected Gradient Method
20%
Constrained Optimization Problem
20%
Nonzero Entry
20%
Subproblem
20%
Computer Science
Penalty Method
100%
Optimization Problem
50%
Constrained Optimization
50%
Gradient Method
50%
Objective Function
50%
Fundamental Problem
50%
Computer Vision
50%
Engineering
Minimizer
100%
Problem Relaxation
66%
Computervision
33%
Fundamental Problem
33%
Constrained Optimization Problem
33%
Subproblem
33%
Nonzero Entry
33%
Objective Function
33%