Pages that link to "Item:Q1650773"

The following pages link to Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773):

Displaying 24 items.

• Strong formulations for conic quadratic optimization with indicator variables (Q2039236) (← links)
• Quadratic optimization with switching variables: the convex hull for \(n=2\) (Q2044962) (← links)
• Submodular function minimization and polarity (Q2097629) (← links)
• Ideal formulations for constrained convex optimization problems with indicator variables (Q2118117) (← links)
• The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables (Q2670502) (← links)
• Linear-step solvability of some folded concave and singly-parametric sparse optimization problems (Q2693645) (← links)
• Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction (Q3386769) (← links)
• A Mixed-Integer Fractional Optimization Approach to Best Subset Selection (Q4995087) (← links)
• (Q4998944) (← links)
• Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization (Q5010043) (← links)
• On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables (Q5041763) (← links)
• An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems (Q5060779) (← links)
• A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure (Q5086011) (← links)
• Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs (Q5108255) (← links)
• Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
• Strong mixed-integer programming formulations for trained neural networks (Q5918909) (← links)
• \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables (Q6052055) (← links)
• A computational study of perspective cuts (Q6062884) (← links)
• A graph-based decomposition method for convex quadratic optimization with indicators (Q6102761) (← links)
• Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix (Q6120849) (← links)
• On the convex hull of convex quadratic optimization problems with indicators (Q6120854) (← links)
• Supermodularity and valid inequalities for quadratic optimization with indicators (Q6165587) (← links)
• Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones (Q6498414) (← links)
• Constrained optimization of rank-one functions with indicator variables (Q6634534) (← links)