The following pages link to Henry Wolkowicz (Q231088):
Displaying 50 items.
- Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions (Q121877) (← links)
- (Q353152) (redirect page) (← links)
- Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)
- (Q457201) (redirect page) (← links)
- The generalized trust region subproblem (Q457202) (← links)
- (Q494340) (redirect page) (← links)
- Extreme point inequalities and geometry of the rank sparsity ball (Q494341) (← links)
- Projection methods for quantum channel construction (Q496914) (← links)
- Local nonglobal minima for solving large-scale extended trust-region subproblems (Q513712) (← links)
- A note on alternating projections for ill-posed semidefinite feasibility problems (Q517318) (← links)
- (Q589155) (redirect page) (← links)
- Dimensionality of biinfinite systems (Q595729) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Euclidean distance matrices, semidefinite programming and sensor network localization (Q716240) (← links)
- Positive definite completions of partial Hermitian matrices (Q798738) (← links)
- A note on generalized invariant cones and the Kronecker canonical form (Q802701) (← links)
- A stable primal-dual approach for linear programming under nondegeneracy assumptions (Q849092) (← links)
- Regularization using a parameterized trust region subproblem (Q959940) (← links)
- Bounds for ratios of eigenvalues using traces (Q1055845) (← links)
- Improving eigenvalue bounds using extra bounds (Q1063660) (← links)
- Normal matrices (Q1088757) (← links)
- An explicit linear solution for the quadratic dynamic programming problem (Q1093562) (← links)
- More bounds for eigenvalues using traces (Q1139642) (← links)
- Bounds for eigenvalues using traces (Q1140142) (← links)
- Regularizing the abstract convex program (Q1156085) (← links)
- Some applications of optimization in matrix theory (Q1158352) (← links)
- A strengthened test for optimality (Q1159136) (← links)
- Method of reduction in convex programming (Q1169402) (← links)
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem (Q1184337) (← links)
- Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality (Q1187508) (← links)
- Generalizations of Slater's constraint qualification for infinite convex programs (Q1198330) (← links)
- Calculating the cone of directions of constancy (Q1240157) (← links)
- Zero duality gaps in infinite-dimensional programming (Q1263531) (← links)
- Solving Euclidean distance matrix completion problems via semidefinite progrmming (Q1294802) (← links)
- A computational study of graph partitioning (Q1340061) (← links)
- A semidefinite framework for trust region subproblems with applications to large scale minimization (Q1373738) (← links)
- Foreword to: Semidefinite programming (Q1374364) (← links)
- An interior-point method for approximate positive semidefinite completions (Q1383832) (← links)
- Semidefinite programming relaxations for the quadratic assignment problem (Q1386486) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Geometry of semidefinite Max-Cut relaxations via matrix ranks (Q1610658) (← links)
- ADMM for the SDP relaxation of the QAP (Q1741118) (← links)
- Low-rank matrix completion using nuclear norm minimization and facial reduction (Q1756746) (← links)
- Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming (Q1779251) (← links)
- A note on lack of strong duality for quadratic problems with orthogonal constraints (Q1848387) (← links)
- A projection technique for partitioning the nodes of a graph (Q1904714) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- Explicit solutions for interval semidefinite linear programs (Q1911421) (← links)
- Strong duality and minimal representations for cone optimization (Q1928754) (← links)
- Generating and measuring instances of hard semidefinite programs (Q1960189) (← links)
