Strong formulations for conic quadratic optimization with indicator variables
type: Item
instance of: scholarly article
title: Strong formulations for conic quadratic optimization with indicator variables
zbMATH Open document ID: 1470.90056
author: Andrés Gómez
published in: Mathematical Programming. Series A. Series B
publication date: 2021-07-02T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7367260
zbMATH Keywords: conic quadratic optimization
zbMATH Keywords: submodularity
zbMATH Keywords: convexification
zbMATH Keywords: conic quadratic cuts
describes a project that uses: MINOTAUR
MaRDI profile type: Publication
full work available at URL: s10107-020-01508-y
OpenAlex ID: W3021266223
cites work: A strong conic quadratic reformulation for machine-job assignment with controllable processing times
cites work: Intersection Cuts for Mixed Integer Conic Quadratic Sets
cites work: Maximizing a Class of Utility Functions Over the Vertices of a Polytope
cites work: Strong formulations for quadratic optimization with M-matrices and indicator variables
cites work: Submodularity in Conic Quadratic Mixed 0–1 Optimization
cites work: Lifted polymatroid inequalities for mean-risk optimization with indicator variables
cites work: Polymatroids and mean-risk minimization in discrete optimization
cites work: Conic mixed-integer rounding cuts
cites work: Lifting for conic mixed-integer programming
cites work: A conic integer programming approach to stochastic joint location-inventory problems
cites work: On families of quadratic surfaces having fixed intersections with two hyperplanes
cites work: A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
cites work: Robust convex optimization
cites work: Robust solutions of uncertain linear programs
cites work: Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
cites work: Introduction to Stochastic Programming
cites work: Lift-and-Project Cuts for Mixed Integer Convex Programs
cites work: On mathematical programming with indicator constraints
cites work: Convex programming for disjunctive convex optimization
cites work: Cuts for mixed 0-1 conic programming
cites work: On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
cites work: Q5684698
cites work: Robust Solutions to Least-Squares Problems with Uncertain Data
cites work: Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
cites work: Perspective cuts for a class of convex 0-1 mixed integer programs
cites work: SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
cites work: A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
cites work: Approximated perspective relaxations: a project and lift approach
cites work: Improving the approximated projected perspective reformulation by dual information
cites work: Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs
cites work: A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
cites work: Perspective reformulations of mixed integer nonlinear programs with indicator variables
cites work: Mixed-integer nonlinear programs featuring ``on/off'' constraints
cites work: Quadratic cone cutting surfaces for quadratic programs with on-off constraints
cites work: Lift-and-project cuts for convex mixed integer nonlinear programs
cites work: On minimal valid inequalities for mixed integer conic programs
cites work: Two-term disjunctions on the second-order cone
cites work: Q3682236
cites work: Mixed integer second-order cone programming formulations for variable selection in linear regression
cites work: Split cuts and extended formulations for mixed integer conic quadratic programming
cites work: Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
cites work: A Strong Dual for Conic Mixed-Integer Programs
cites work: Capacitated warehouse location model with risk pooling
cites work: Lifting inequalities: a framework for generating strong cuts for nonlinear programs
cites work: Some cut-generating functions for second-order conic sets
cites work: A branch-and-cut method for 0-1 mixed convex programming
cites work: Quadratic Convex Reformulations for Semicontinuous Quadratic Programming
cites work: Scalable Algorithms for the Sparse Ridge Regression
cites work: Disjunctive cuts for cross-sections of the second-order cone
cites work: Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
DOI: 10.1007/S10107-020-01508-Y
description: scientific article; zbMATH DE number 7367260