Polyhedral analysis of quadratic optimization problems with Stieltjes matrices and indicators
From MaRDI portal
Cites work
- \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables
- A first-order block-decomposition method for solving two-easy-block structured semidefinite programs
- A graph-based decomposition method for convex quadratic optimization with indicators
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Alternating direction augmented Lagrangian methods for semidefinite programming
- An analysis of approximations for maximizing submodular set functions—I
- Bayesian image restoration, with two applications in spatial statistics (with discussion)
- Compact extended formulations for low-rank functions with indicator variables
- Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix
- Conditions for Positive and Nonnegative Definiteness in Terms of Pseudoinverses
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Constrained optimization of rank-one functions with indicator variables
- Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Ideal formulations for constrained convex optimization problems with indicator variables
- Inverses of 2 2 block matrices
- M-matrix characterizations. I: nonsingular M-matrices
- Maximizing a class of submodular utility functions
- Maximizing a class of utility functions over the vertices of a polytope
- On the convex hull of convex quadratic optimization problems with indicators
- On the convexification of constrained quadratic optimization problems with indicator variables
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Polymatroids and mean-risk minimization in discrete optimization
- Rank-one convexification for sparse regression
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Sparse and smooth signal estimation: convexification of \(\ell_0\)-formulations
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Submodular function minimization and polarity
- Supermodularity and valid inequalities for quadratic optimization with indicators
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
This page was built for publication: Polyhedral analysis of quadratic optimization problems with Stieltjes matrices and indicators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346545)
