Filter Results:
- Full text PDF available (95)
Publication Year
1979
2018
- This year (3)
- Last 5 years (22)
- Last 10 years (47)
Publication Type
Co-author
Journals and Conferences
Learn More
- Panos M. Pardalos, Franz Rendl, Henry Wolkowicz
- Quadratic Assignment and Related Problems
- 1993
Quadratic Assignment Problems model many applications in diverse areas such as operations research, parallel and distributed computing , and combinatorial data analysis. In this paper we survey some… (More)
- Christoph Helmberg, Franz Rendl, Robert J. Vanderbei, Henry Wolkowicz
- SIAM Journal on Optimization
- 1996
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.… (More)
- Qing Zhao, Stefan E. Karisch, Franz Rendl, Henry Wolkowicz
- J. Comb. Optim.
- 1998
Semideenite programming(SDP) relaxations for the quadratic assignment problem (QAP) are derived using the dual of the (homogenized) Lagrangian dual of appropriate equivalent representations of QAP.… (More)
- Franz Rendl, Henry Wolkowicz
- Math. Program.
- 1997
Primal-dual pairs of semidefinite programs provide a general framework for the theory and algorithms for the trust region subproblem (TRS), This latter problem consists in minimizing a general… (More)
- Erna Unrau, Henry Wolkowicz, Romesh Saigal, Lieven Vandenberghe, Florian Jarre, A Pataki
Semide nite programming (or SDP) has been one of the most exciting and active research areas in optimization during the 1990s. It has attracted researchers with very diverse backgrounds, including… (More)
- Abdo Y. Alfakih, Amir Khandani, Henry Wolkowicz
- Comp. Opt. and Appl.
- 1999
Given a partial symmetric matrixA with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP) is to find the unspecified elements of A that makeA a Euclidean… (More)
- Kurt M. Anstreicher, Henry Wolkowicz
- SIAM J. Matrix Analysis Applications
- 2000
Quadratically constrained quadratic programs (QQPs) play an important modeling role for many diverse problems. These problems are in general NP hard and numerically intractable. Lagrangian… (More)
- Franz Rendl, Henry Wolkowicz
- Annals OR
- 1995
Let G = (N, E) be an undirected graph with node set N = { 1 ..... n }, edge set E and edge weights {c(e) : e ~ E}. (If the graph is unweighted, then we assume c(e) = 1 for e E E.) A common problem in… (More)
- Svatopluk Poljak, Franz Rendl, Henry Wolkowicz
- J. Global Optimization
- 1995
We review various relaxations of (0,1)-quadratic programming problems. These include semidefinite programs, parametric trust region problems and concave quadratic maximization. All relaxations that… (More)
- Motakuri V. Ramana, Levent Tunçel, Henry Wolkowicz
- SIAM Journal on Optimization
- 1997
It is well known that the duality theory for linear programming (LP) is powerful and elegant and lies behind algorithms such as simplex and interior-point methods. However, the standard Lagrangian… (More)