The spherical constraint in Boolean quadratic programs
From MaRDI portal
Publication:925238
DOI10.1007/S10898-007-9161-1zbMATH Open1146.90043OpenAlexW2014548643MaRDI QIDQ925238FDOQ925238
Authors: Jérôme Malick 
Publication date: 3 June 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00070518/file/07-malick.pdf
Recommendations
- A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm1
- The Boolean quadratic programming problem with generalized upper bound constraints
- An efficient method for obtaining sharp bounds for nonlinear boolean programming problems
- Functionally redundant constraints for Boolean quadratic-type optimization problems
- A new semidefinite relaxation for \(L_{1}\)-constrained quadratic
Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Boolean programming (90C09)
Cites Work
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Computing the nearest correlation matrix--a problem from finance
- Title not available (Why is that?)
- A Spectral Bundle Method for Semidefinite Programming
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Shannon capacity of a graph
- Title not available (Why is that?)
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A Dual Approach to Semidefinite Least-Squares Problems
- Convex analysis and nonlinear optimization. Theory and examples
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Introduction to global optimization.
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Seizure warning algorithm based on optimization and nonlinear dynamics
- SDP relaxations in combinatorial optimization from a Lagrangian viewpoint.
- Lower bound improvement and forcing rule for quadratic binary programming
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation
- Title not available (Why is that?)
- Iterative Solution of Linear Programs
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- A nonlinear equation for linear programming
Cited In (11)
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- Improved row-by-row method for binary quadratic optimization problems
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- The Boolean quadratic programming problem with generalized upper bound constraints
- On the spherical quasi-convexity of quadratic functions
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- Efficient semidefinite branch-and-cut for MAP-MRF inference
- A variational approach of the rank function
- A low complexity semidefinite relaxation for large-scale MIMO detection
- Solving \(k\)-cluster problems to optimality with semidefinite programming
Uses Software
This page was built for publication: The spherical constraint in Boolean quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925238)
