◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Hao Hu

7 papers hereh-index 9204 citations29 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author3
  • middle author4

Across the 7 of 7 papers where every author was matched, so the position is known.

fields
  • math.OC4
  • cs.CV3
same name
  • Hao Hu — 6 papers, h 22
  • Hao Hu — 6 papers
  • Hao Hu — 5 papers
  • Hao Hu — 4 papers, h 33
  • Hao Hu — 2 papers, h 8
  • Hao Hu — 2 papers

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20172021
most citedA Restricted Dual Peaceman-Rachford Splitting Method for QAP

3 citations · 6 across the 5 of their papers we have counts for

collaborators
Showing math.OCShow all

4 papers · 1 filter

math.OC2021

A Semismooth Newton-Type Method for the Nearest Doubly Stochastic Matrix Problem

Hao Hu, Haesol Im, Xinxin Li +1

We study a semismooth Newton-type method for the nearest doubly stochastic matrix problem where both differentiability and nonsingularity of the Jacobian can fail. The optimality c…

math.OC2020★ 3 cited

A Restricted Dual Peaceman-Rachford Splitting Method for QAP

Naomi Graham, Hao Hu, Haesol Im +2

We revisit and strengthen splitting methods for solving doubly nonnegative, DNN, relaxations of the quadratic assignment problem, QAP. We use a modified restricted contractive spli…

math.OC2018

The linearization problem of a binary quadratic problem and its applications

Hao Hu, Renata Sotirov

We provide several applications of the linearization problem of a binary quadratic problem. We propose a new lower bounding strategy, called the linearization-based scheme, that is…

math.OC2017★ 2 cited

On Solving the Quadratic Shortest Path Problem

Hao Hu, Renata Sotirov

The quadratic shortest path problem is the problem of finding a path in a directed graph such that the sum of interaction costs over all pairs of arcs on the path is minimized. We…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.