H. Wolkowicz

Publications214
h-index45
Citations9,454
Highly Influential Citations597
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • F. Rendl
  • 128 Publications • 7,449 Citations
  • Y. Ye
  • 428 Publications • 25,310 Citations
  • M. Kojima
  • 199 Publications • 8,378 Citations
  • J. Borwein
  • 806 Publications • 25,752 Citations
  • Publications
  • Influence
An Interior-Point Method for Semidefinite Programming
We propose a new interior-point-based method to minimize a linear function of a matrix variable subject to linear equality and inequality constraints over the set of positive semidefinite matrices....
Positive definite completions of partial Hermitian matrices
Handbook of semidefinite programming : theory, algorithms, and applications
TLDR
The aim of this monograph is to provide a Discussion of the Foundations of Semidefinite Programming and its Applications, as well as some Applications and Extensions, which were developed after the original book was written.
Semidefinite Programming Relaxations for the Quadratic Assignment Problem
TLDR
These new relaxations, and their duals, satisfy the Slater constraint qualification, and so can be solved numerically using primal-dual interior-point methods.
SIAM Journal on Optimization
The SIAM Journal on Optimization contains research articles on the theory and practice of optimization. The areas addressed include linear and quadratic programming, convex programming, nonlinear…
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming
TLDR
A primal-dual interior-point algorithm is introduced that solves an equivalent (quadratic objective function) semidefinite programming problem (SDP) and demonstrates the efficiency and robustness of this approach.
A semidefinite framework for trust region subproblems with applications to large scale minimization
TLDR
A dual simplex type method is studied that solves (TRS) as a parametric eigenvalue problem and the essential cost of the algorithm is the matrix-vector multiplication and, thus, sparsity can be exploited.
Regularizing the Abstract Convex Program
Strong Duality for Semidefinite Programming
TLDR
The relationships among various duals are discussed and a unified treatment for strong duality in semidefinite programming is given.
The Quadratic Assignment Problem: A Survey and Recent Developments
TLDR
This paper surveys some of the most important techniques, applications, and methods regarding the quadratic assignment problem and focuses on recent developments.
...
1
2
3
4
5
...