Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
From MaRDI portal
Publication:2940060
DOI10.1287/IJOC.2014.0592zbMath1304.90154DBLPjournals/informs/ZhengSL14OpenAlexW2049967295WikidataQ57445420 ScholiaQ57445420MaRDI QIDQ2940060
Xiaoling Sun, Li, Duan, Xiao Jin Zheng
Publication date: 26 January 2015
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2014.0592
Lagrangian decompositionperspective reformulationsemidefinite programdiagonal decompositionquadratic programming with semicontinuous variables and cardinality constraint
Related Items (35)
On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables ⋮ Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints ⋮ An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems ⋮ A new algorithm for quadratic integer programming problems with cardinality constraint ⋮ A Scalable Algorithm for Sparse Portfolio Selection ⋮ Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming ⋮ Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs ⋮ The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables ⋮ Quadratic Convex Reformulations for Semicontinuous Quadratic Programming ⋮ A new perspective on low-rank optimization ⋮ \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables ⋮ A computational study of perspective cuts ⋮ A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization ⋮ Complex portfolio selection via convex mixed‐integer quadratic programming: a survey ⋮ Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods ⋮ High-Dimensional Portfolio Selection with Cardinality Constraints ⋮ Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs ⋮ On the convex hull of convex quadratic optimization problems with indicators ⋮ Cardinality constrained portfolio selection problem: a completely positive programming approach ⋮ Supermodularity and valid inequalities for quadratic optimization with indicators ⋮ Sparse Markowitz portfolio selection by using stochastic linear complementarity approach ⋮ Improving the approximated projected perspective reformulation by dual information ⋮ The complexity results of the sparse optimization problems and reverse convex optimization problems ⋮ Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization ⋮ A half thresholding projection algorithm for sparse solutions of LCPs ⋮ A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints ⋮ Quadratic cone cutting surfaces for quadratic programs with on-off constraints ⋮ Strong formulations for conic quadratic optimization with indicator variables ⋮ Quadratic optimization with switching variables: the convex hull for \(n=2\) ⋮ Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach ⋮ Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations ⋮ Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables ⋮ Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs ⋮ Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization ⋮ Ideal formulations for constrained convex optimization problems with indicator variables
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Algorithm for cardinality-constrained quadratic optimization
- Lagrangean decomposition for integer nonlinear programming with linear constraints
- Optimization of cardinality constrained portfolios with a hybrid local search algorithm
- Heuristics for cardinality constrained portfolio optimization
- Computational study of a family of mixed-integer quadratic programming problems
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Lectures on Modern Convex Optimization
- Optimal Cardinality Constrained Portfolio Selection
- An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
- Better Subset Regression Using the Nonnegative Garrote
- Lagrangian relaxation procedure for cardinality-constrained portfolio optimization
- The Optimal Selection of Small Portfolios
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Semidefinite Programming
- On the Non-Negative Garrotte Estimator
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
- A Survey of the S-Lemma
- Semidefinite relaxations of fractional programs via novel convexification techniques
This page was built for publication: Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
