Wolkowicz, Henry, 1948-
Wolkowicz, Henry.
Henry Wolkowicz Ph.D. McGill University 1978
VIAF ID: 12549798 ( Personal )
Permalink: http://viaf.org/viaf/12549798
Preferred Forms
- 100 0 _ ‡a Henry Wolkowicz ‡c Ph.D. McGill University 1978
- 200 _ | ‡a Wolkowicz ‡b Henry ‡f 1948-....
- 100 1 0 ‡a Wolkowicz, Henry
-
-
-
- 100 1 _ ‡a Wolkowicz, Henry
- 100 1 _ ‡a Wolkowicz, Henry ‡d 1948-
-
- 100 1 _ ‡a Wolkowicz, Henry, ‡d 1948-
-
4xx's: Alternate Name Forms (1)
5xx's: Related Names (5)
- 551 _ _ ‡a Kanada ‡4 ortw ‡4 https://d-nb.info/standards/elementset/gnd#placeOfActivity
- 551 _ _ ‡a Montréal ‡4 ortw ‡4 https://d-nb.info/standards/elementset/gnd#placeOfActivity
- 510 2 _ ‡a University of Waterloo ‡b Department of Combinatorics and Optimization ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 551 _ _ ‡a Waterloo ‡g Ontario ‡4 ortw ‡4 https://d-nb.info/standards/elementset/gnd#placeOfActivity
- 551 _ _ ‡a Łódź ‡4 ortg ‡4 https://d-nb.info/standards/elementset/gnd#placeOfBirth
Works
Title | Sources |
---|---|
Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem | |
Computational and analytical mathematics : in honor of Jonathan Borwein's 60th Birthday | |
A computational study of graph partitioning | |
Convergence of an infeasible short-step path-following algorithm based on the Gauss-Newton direction | |
Exponential nonnegativity on the ice cream cone | |
Generalizations of Slaterþs constraint qualification for infinite convex programs | |
Generating and measuring instances of hard semidefinite programs, SDP | |
Geometry of semidefinite max-cut relaxations via ranks | |
Handbook of semidefinite programming : theory, algorithms, and applications | |
An interior-point method for the Euclidean distance matrix completion problem | |
Invariant ellipsoidal cones | |
Kantorovich's general theory of approximation methods | |
Large scale portfolio optimization with piecewise linear transaction costs | |
A matrix-lifting semidefinite relaxation for the quadratic assignment problem | |
Max-min eigenvalue problems, primal-dual interior point algorithms, and trust region subproblems | |
A measure for the optimal conditioned symmetric one-rank update | |
A note on generalized invariant cones and the Kronecker canonical form | |
A note on lack of strong duality for quadratic problems with orthogonal constraints | |
Novel approaches to hard discrete optimization | |
On the embeddability of weighted graphs in Euclidean spaces | |
Operator equations and convex programming | |
A projection technique for partioning the nodes of a graph | |
Quadratic assignment and related problems : DIMACS Workshop, May 20-21, 1993 | |
The quasi-Cauchy relation and diagonal updating | |
Regularization using a parameterized trust region subproblem | |
Semidefinite programming and interior-point approaches for combinatorial optimization problems / Panos M. Pardalos and Henry Wolkowicz. | |
Simple efficient solutions for semidefinite programming | |
Sizing and least change secant methods | |
SQ²P : sequential quadratic constrained quadratic programming | |
A stable iterative method for linear programming | |
A strengthened SDP relaxation via a second lifting for the Max-Cut problem | |
A survey of the trust region subproblem within a semidefinite programming framework | |
Taking advantage of degeneracy in linear programming | |
Topics in semidefinite and interior-point methods | |
Two theorems on Euclidean distance matrices and Gale transform | |
A volume and constraint reducing algorithm for linear programming | |
Zero duality gaps in infinite dimensional programming |