Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Henry Wolkowicz
Information about the author Henry Wolkowicz will soon be added to the site.
Found
15 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
The generalized trust region subproblem
2014
The interval bounded generalized trust region subproblem (GTRS) consists in minimizing...
Strong duality and minimal representations for cone optimization
2012
The elegant theoretical results for strong duality and strict complementarity for...
On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming
2011
We analyze two popular semidefinite programming relaxations for quadratically...
A stable primal–dual approach for linear programming under nondegeneracy assumptions
2009
This paper studies a primal–dual interior/exterior-point path-following approach...
A note on lack of strong duality for quadratic problems with orthogonal constraints
2002
The general quadratically constrained quadratic program (QQP) is an important...
Solving Euclidean distance matrix completion problems via semidefinite programming
1999
Given a partial symmetric matrix A with only certain elements specified, the Euclidean...
Semidefinite programming relaxations for the graph partitioning problem
1999
A new semidefinite programming, SDP, relaxation for the general graph partitioning...
An interior-point method for approximate positive semidefinite completions
1998
Given a nonnegative, symmetric matrix of weights, H , we study the problem of finding...
Semidefinite programming
1997
No abstract. An introduction to a grouping of papers in Mathematical Programming...
A semidefinite framework for trust region subproblems with applications to large scale minimization
1997
Primal–dual pairs of semidefinite programs provide a general framework for the...
A computational study of graph partitioning
1994
Let G=(N,E) be an edge-weighted undirected graph. The graph partitioning problem is...
A projection technique for partitioning the nodes of a graph
1995
Let G=(N,E) be an undirected graph. The authors present several new techniques for...
Measures for symmetric rank-one updates
1994
Measures of deviation of a symmetric positive definite matrix from the identity are...
Generalization of Slater’s constraint qualification for infinite convex programs
1992
where g=(g 1 ,g 2 ) and S=S 1 ×S 2 , S i are convex cones, i=1,2 C is a convex...
Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
1992
The authors investigate new bounding strategies based on different relaxations of the...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers