Cutting Plane Generation through Sparse Principal Component Analysis
From MaRDI portal
Publication:5081781
DOI10.1137/21M1399956zbMath1494.90083MaRDI QIDQ5081781
Andrea Lodi, Aleksandr M. Kazachkov, Gonzalo Muñoz, Santanu S. Dey
Publication date: 17 June 2022
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
nonconvex optimizationsparse principal component analysisquadratically constrained quadratic programssparse cutting planes
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Approximating polyhedra with sparse inequalities
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Approximating quadratic programming with bound and quadratic constraints
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Theoretical challenges towards cutting-plane selection
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Sparse PSD approximation of the PSD cone
- On the tightness of SDP relaxations of QCQPs
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- A branch-and-cut algorithm for mixed-integer bilinear programming
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
- Intersection cuts for polynomial optimization
- New SOCP relaxation and branching rule for bipartite bilinear programs
- A gentle, geometric introduction to copositive optimization
- NP-hardness and inapproximability of sparse PCA
- Facets of a mixed-integer bilinear covering set with bounds on variables
- Coordinated cutting plane generation via multi-objective separation
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Generalized power method for sparse principal component analysis
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
- The Sparse Principal Component of a Constant-Rank Matrix
- On Nonconvex Quadratic Programming with Box Constraints
- Solving Real-World Linear Programs: A Decade and More of Progress
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Solving Quadratic Programming by Cutting Planes
- Scalable Semidefinite Programming
- Maximal Quadratic-Free Sets
- Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms
- The Convex Hull of a Quadratic Constraint over a Polytope
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Sparsity of Lift-and-Project Cutting Planes
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
