Henry Wolkowicz

Orcid: 0000-0003-1572-3060

Affiliations:
  • University of Waterloo, Department of Mathematics, Canada


According to our database1, Henry Wolkowicz authored at least 80 papers between 1980 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Revisiting degeneracy, strict feasibility, stability, in linear programming.
Eur. J. Oper. Res., October, 2023

Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs.
Math. Program., 2023

Preconditioning for Generalized Jacobians with the ω-Condition Number.
CoRR, 2023

2022
Robust Interior Point Method for Quantum Key Distribution Rate Computation.
Quantum, September, 2022

A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP.
INFORMS J. Comput., 2022

2021
Error Bounds and Singularity Degree in Semidefinite Programming.
SIAM J. Optim., 2021

A strengthened Barvinok-Pataki bound on SDP rank.
Oper. Res. Lett., 2021

A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem.
Comput. Optim. Appl., 2021

2020
Parametric convex quadratic relaxation of the quadratic knapsack problem.
Eur. J. Oper. Res., 2020

2019
Noisy Euclidean distance matrix completion with a single missing node.
J. Glob. Optim., 2019

2018
ADMM for the SDP relaxation of the QAP.
Math. Program. Comput., 2018

Low-rank matrix completion using nuclear norm minimization and facial reduction.
J. Glob. Optim., 2018

2017
Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier.
SIAM J. Optim., 2017

A note on alternating projections for ill-posed semidefinite feasibility problems.
Math. Program., 2017

The Many Faces of Degeneracy in Conic Optimization.
Found. Trends Optim., 2017

Local nonglobal minima for solving large-scale extended trust-region subproblems.
Comput. Optim. Appl., 2017

Finding maximum rank moment matrices by facial reduction on primal form and Douglas-Rachford iteration.
ACM Commun. Comput. Algebra, 2017

An SDP-based Method for the Real Radical Ideal Membership Test.
Proceedings of the 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2017

2016
Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem.
Comput. Optim. Appl., 2016

Semidefinite facial reduction and rigid cluster elastic network interpolation of protein structures.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2016

2015
Coordinate Shadows of Semidefinite and Euclidean Distance Matrices.
SIAM J. Optim., 2015

Projection methods for quantum channel construction.
Quantum Inf. Process., 2015

Extreme point inequalities and geometry of the rank sparsity ball.
Math. Program., 2015

Facial Reduction and SDP Methods for Systems of Polynomial Equations.
CoRR, 2015

2014
Efficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations.
INFORMS J. Comput., 2014

The generalized trust region subproblem.
Comput. Optim. Appl., 2014

2013
Preface.
Math. Program., 2013

Determining Protein Structures from NOESY Distance Constraints by Semidefinite Programming.
J. Comput. Biol., 2013

2012
A robust algorithm for semidefinite programming.
Optim. Methods Softw., 2012

Strong duality and minimal representations for cone optimization.
Comput. Optim. Appl., 2012

Protein Structure by Semidefinite Facial Reduction.
Proceedings of the Research in Computational Molecular Biology, 2012

2011
On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming.
Math. Oper. Res., 2011

2010
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions.
SIAM J. Optim., 2010

Generating and measuring instances of hard semidefinite programs.
Math. Program., 2010

2009
Duality for Semidefinite Programming.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Regularization using a parameterized trust region subproblem.
Math. Program., 2009

A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem.
Math. Oper. Res., 2009

A stable primal-dual approach for linear programming under nondegeneracy assumptions.
Comput. Optim. Appl., 2009

2008
Large scale portfolio optimization with piecewise linear transaction costs.
Optim. Methods Softw., 2008

Sensor network localization, euclidean distance matrix completions, and graph realization.
Proceedings of the ACM International Workshop on Mobile Entity Localization and Tracking in GPS-less Environments, 2008

2007
Foreword: Special issue on large-scale nonlinear and semidefinite programming.
Math. Program., 2007

2006
Multi-Stage Investment Decision under Contingent Demand for Networking Planning.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2004
Solving semidefinite programs using preconditioned conjugate gradients.
Optim. Methods Softw., 2004

The trust region subproblem and semidefinite programming.
Optim. Methods Softw., 2004

2002
Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks.
J. Comb. Optim., 2002

A note on lack of strong duality for quadratic problems with orthogonal constraints.
Eur. J. Oper. Res., 2002

Semidefinite programming for discrete optimization and matrix completion problems.
Discret. Appl. Math., 2002

Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem.
Discret. Appl. Math., 2002

2000
On Lagrangian Relaxation of Quadratic Matrix Constraints.
SIAM J. Matrix Anal. Appl., 2000

1999
Pseudolinear Programming.
SIAM Rev., 1999

The Quasi-Cauchy Relation and Diagonal Updating.
SIAM J. Optim., 1999

Semidefinite Programming Relaxations for the Graph Partitioning Problem.
Discret. Appl. Math., 1999

Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming.
Comput. Optim. Appl., 1999

Semidefinite and Lagrangian Relaxations for Hard Combinatorial Problems.
Proceedings of the System Modelling and Optimization: Methods, 1999

1998
Semidefinite Programming Relaxations for the Quadratic Assignment Problem.
J. Comb. Optim., 1998

Preface.
J. Comb. Optim., 1998

An Interior-Point Method for Approximate Positive Semidefinite Completions.
Comput. Optim. Appl., 1998

1997
Strong Duality for Semidefinite Programming.
SIAM J. Optim., 1997

A semidefinite framework for trust region subproblems with applications to large scale minimization.
Math. Program., 1997

Semidefinite Programming.
Math. Program., 1997

1996
An Interior-Point Method for Semidefinite Programming.
SIAM J. Optim., 1996

1995
An All-Inclusive Efficient Region of Updates for Least Change Secant Methods.
SIAM J. Optim., 1995

Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations.
SIAM J. Optim., 1995

Convex Relaxations of (0, 1)-Quadratic Programming.
Math. Oper. Res., 1995

A recipe for semidefinite relaxation for (0, 1)-quadratic programming - In memory of Svata Poljak.
J. Glob. Optim., 1995

A projection technique for partitioning the nodes of a graph.
Ann. Oper. Res., 1995

Combining Semidefinite and Polyhedral Relaxations for Integer Programs.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994
Trust Region Problems and Nonsymmetric Eigenvalue Perturbations.
SIAM J. Matrix Anal. Appl., July, 1994

Matrix Differentiation Identities (Peter J. Costa and Stanley Rabinowitz).
SIAM Rev., 1994

A computational study of graph partitioning.
Math. Program., 1994

Measures for Symmetric Rank-One Updates.
Math. Oper. Res., 1994

1993
The Quadratic Assignment Problem: A Survey and Recent Developments.
Proceedings of the Quadratic Assignment and Related Problems, 1993

Trust Regions and Relaxations for the Quadratic Assignment Problem.
Proceedings of the Quadratic Assignment and Related Problems, 1993

1992
Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem.
Math. Program., 1992

Generalizations of Slater's constraint qualification for infinite convex programs.
Math. Program., 1992

A New Lower Bound Via Projection for the Quadratic Assignment Problem.
Math. Oper. Res., 1992

1990
Bounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1986
A nonlinear equation for linear programming.
Math. Program., 1986

A simple constraint qualification in infinite dimensional programming.
Math. Program., 1986

1980
Geometry of optimality conditions and constraint qualifications: The convex case.
Math. Program., 1980


  Loading...