SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
From MaRDI portal
Publication:2643791
Recommendations
- Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
Cites work
- scientific article; zbMATH DE number 970565 (Why is no real title available?)
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints
- Computational study of a family of mixed-integer quadratic programming problems
- Perspective cuts for a class of convex 0-1 mixed integer programs
Cited in
(52)- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023
- Tight SDP relaxations for cardinality-constrained problems
- Relaxed method for optimization problems with cardinality constraints
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
- Constrained composite optimization and augmented Lagrangian methods
- The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming
- Perspective reformulation and applications
- Extended formulations in mixed integer conic quadratic programming
- A computational study of perspective cuts
- Minotaur: a mixed-integer nonlinear optimization toolkit
- On the convexification of constrained quadratic optimization problems with indicator variables
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- Quadratic convex reformulations for semicontinuous quadratic programming
- Strong formulations for conic quadratic optimization with indicator variables
- Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
- An augmented Lagrangian method for optimization problems with structured geometric constraints
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- Improving the approximated projected perspective reformulation by dual information
- Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization
- Ideal formulations for constrained convex optimization problems with indicator variables
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach
- Cardinality constrained portfolio selection problem: a completely positive programming approach
- Using \(\ell_1\)-relaxation and integer programming to obtain dual bounds for sparse PCA
- Lifted polymatroid inequalities for mean-risk optimization with indicator variables
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- A Scalable Algorithm for Sparse Portfolio Selection
- Compact mixed-integer programming formulations in quadratic optimization
- Outlier detection in time series via mixed-integer conic quadratic optimization
- Perspective reformulations of the CTA problem with \(L_2\) distances
- A penalty PALM method for sparse portfolio selection problems
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs
- Supermodularity and valid inequalities for quadratic optimization with indicators
- QPLIB: a library of quadratic programming instances
- Approximated perspective relaxations: a project and lift approach
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
- Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization
- Global convergence of augmented Lagrangian method applied to mathematical program with switching constraints
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- Quadratic convex reformulation for quadratic programming with linear on-off constraints
- A unified approach to mixed-integer optimization problems with logical constraints
- On the convex hull of convex quadratic optimization problems with indicators
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems
- An augmented Lagrangian method for cardinality-constrained optimization problems
- \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables
- Relaxation schemes for mathematical programmes with switching constraints
- An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
This page was built for publication: SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643791)
