The following pages link to Henry Wolkowicz (Q231088):
Displayed 50 items.
- Semidefinite programming relaxations for the graph partitioning problem (Q1961466) (← links)
- Strong duality for a trust-region type relaxation of the quadratic assignment problem (Q1970512) (← links)
- Noisy Euclidean distance matrix completion with a single missing node (Q2010104) (← links)
- Maximum determinant positive definite Toeplitz completions (Q2010522) (← links)
- A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem (Q2028477) (← links)
- Robust principal component analysis using facial reduction (Q2218887) (← links)
- Invariant ellipsoidal cones (Q2277547) (← links)
- Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← links)
- Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming (Q2566758) (← links)
- Convergence of a short-step primal-dual algorithm based on the Gauss-Newton direction (Q2570863) (← links)
- A strengthened Barvinok-Pataki bound on SDP rank (Q2670438) (← links)
- On Lagrangian Relaxation of Quadratic Matrix Constraints (Q2706239) (← links)
- (Q2712834) (← links)
- (Q2768060) (← links)
- Euclidean Distance Matrices and Applications (Q2802549) (← links)
- Hiroshima’s theorem and matrix norm inequalities (Q2820745) (← links)
- Efficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations (Q2940065) (← links)
- Sizing and Least-Change Secant Methods (Q3142629) (← links)
- An eigenvalue majorization inequality for positive semidefinite block matrices (Q3143340) (← links)
- The Gauss-Newton direction in semidefinite programming (Q3146531) (← links)
- A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem (Q3169078) (← links)
- On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming (Q3169131) (← links)
- Exponential Nonnegativity on the Ice Cream Cone (Q3203162) (← links)
- Nonnegative Solutions of a Quadratic Matrix Equation Arising from Comparison Theorems in Ordinary Differential Equations (Q3222983) (← links)
- An optimality condition for a nondifferentiable convex program (Q3320133) (← links)
- (Q3320135) (← links)
- Improving Hadamard's inequality<sup>*</sup> (Q3340986) (← links)
- Large scale portfolio optimization with piecewise linear transaction costs (Q3605210) (← links)
- A nonlinear equation for linear programming (Q3724087) (← links)
- A note on maximizing the permanent of a positive definite hermitian matrix, given the eigenvalues<sup>∗</sup> (Q3729089) (← links)
- A simple constraint qualification in infinite dimensional programming (Q3731366) (← links)
- Post-Processing Piecewise Cubics for Monotonicity (Q3833488) (← links)
- (Q3840112) (← links)
- (Q3863701) (← links)
- Geometry of optimality conditions and constraint qualifications: The convex case (Q3877415) (← links)
- (Q3908774) (← links)
- (Q3916398) (← links)
- (Q3923971) (← links)
- Characterizations of optimality without constraint qualification for the abstract convex program (Q3959766) (← links)
- A New Lower Bound Via Projection for the Quadratic Assignment Problem (Q4022029) (← links)
- Calculating the Best Approximate Solution of an Operator Equation (Q4192900) (← links)
- Trust Region Problems and Nonsymmetric Eigenvalue Perturbations (Q4305391) (← links)
- (Q4321546) (← links)
- (Q4321556) (← links)
- Strong Duality for Semidefinite Programming (Q4377577) (← links)
- (Q4517096) (← links)
- (Q4517108) (← links)
- (Q4517113) (← links)
- (Q4517115) (← links)
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier (Q4588863) (← links)