Semidefinite programming for discrete optimization and matrix completion problems
From MaRDI portal
Publication:697582
DOI10.1016/S0166-218X(01)00352-3zbMath1060.90059OpenAlexW2023710022MaRDI QIDQ697582
Miguel F. Anjos, Henry Wolkowicz
Publication date: 17 September 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00352-3
Related Items
Structure methods for solving the nearest correlation matrix problem, Using the eigenvalue relaxation for binary least-squares estimation problems, An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs, A note on the Lasserre hierarchy for different formulations of the maximum independent set problem, Dimensionality reduction of SDPs through sketching, A guide to conic optimisation and its applications, Optimality criteria without constraint qualifications for linear semidefinite problems, An improved semidefinite programming relaxation for the satisfiability problem, Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality, Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons, A convex optimisation framework for the unequal-areas facility layout problem, Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming, Introduction to Semidefinite, Conic and Polynomial Optimization, A global continuation algorithm for solving binary quadratic programming problems, A semidefinite optimization approach for the single-row layout problem with unequal dimensions, Global Registration of Multiple Point Clouds Using Semidefinite Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Positive definite completions of partial Hermitian matrices
- Completions of \(M\)-matrix patterns
- Methods for constructing distance matrices and the inverse eigenvalue problem
- Quadratic programming with one negative eigenvalue is NP-hard
- Positive semidefinite completions of partial Hermitian matrices
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Positive definite completions and determinant maximization
- Maximum rank matrix completion
- The symmetric inverse \(M\)-matrix completion problem
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- The sandwich theorem
- Semidefinite programming relaxation for nonconvex quadratic programs
- Semidefinite programming in combinatorial optimization
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- Cuts, matrix completions and graph rigidity
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A connection between positive semidefinite and Euclidean distance matrix completion problems
- An interior-point method for approximate positive semidefinite completions
- Semidefinite programming relaxations for the quadratic assignment problem
- Approximating quadratic programming with bound and quadratic constraints
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Geometry of semidefinite Max-Cut relaxations via matrix ranks
- Completions of inverse \(M\)-matrix patterns
- Determinantal formulae for matrix completions associated with chordal graphs
- Connections between the real positive semidefinite and distance matrix completion problems
- Partially specified matrices and operators: classification, completion, applications
- A projection technique for partitioning the nodes of a graph
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Maximal rank Hermitian completions of partially specified Hermitian matrices.
- Distance geometry optimization for protein structures
- Strong duality for a trust-region type relaxation of the quadratic assignment problem
- On Lagrangian Relaxation of Quadratic Matrix Constraints
- Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems
- Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- A projected gradient algorithm for solving the maxcut SDP relaxation
- The Gauss-Newton direction in semidefinite programming
- Inertia possibilities for completions of partial hermitian matrices*
- Matrix Completion Theorems
- A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm1
- A comparison of the Delsarte and Lovász bounds
- Cones of Matrices and Set-Functions and 0–1 Optimization
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- Matrix Completions, Norms, and Hadamard Products
- On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
- Approximate Semidefinite Matrices in a Linear Variety
- The Geometry of Algorithms with Orthogonality Constraints
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Remarks on a difficult test problem for quadratic boolean programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Strong Duality for Semidefinite Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- The combinatorially symmetric P-matrix completion problem
- Determinant Maximization with Linear Matrix Inequality Constraints
- Copositive realxation for genera quadratic programming
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- CSDP, A C library for semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- SDPLIB 1.2, a library of semidefinite programming test problems
- A Spectral Bundle Method for Semidefinite Programming
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- The Euclidian Distance Matrix Completion Problem
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- The Molecule Problem: Exploiting Structure in Global Optimization
- Convex Relaxations of (0, 1)-Quadratic Programming
- An Interior-Point Method for Semidefinite Programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Some convexity theorems for matrices
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Semidefinite programming and combinatorial optimization
- Semidefinite programming and combinatorial optimization
