Pages that link to "Item:Q833581"

The following pages link to A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes (Q833581):

Displaying 29 items.

• Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
• Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204) (← links)
• Recent advances in mathematical programming with semi-continuous variables and cardinality constraint (Q384213) (← links)
• On interval-subgradient and no-good cuts (Q613320) (← links)
• Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
• Cardinality constrained portfolio selection problem: a completely positive programming approach (Q898723) (← links)
• Extended formulations in mixed integer conic quadratic programming (Q1688453) (← links)
• Improving the approximated projected perspective reformulation by dual information (Q1728322) (← links)
• Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs (Q1926817) (← links)
• A new optimal electricity market bid model solved through perspective cuts (Q1948528) (← links)
• A fast exact method for the capacitated facility location problem with differentiable convex production costs (Q2030454) (← links)
• Strong formulations for conic quadratic optimization with indicator variables (Q2039236) (← links)
• Ideal formulations for constrained convex optimization problems with indicator variables (Q2118117) (← links)
• A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function (Q2181606) (← links)
• QPLIB: a library of quadratic programming instances (Q2281448) (← links)
• An augmented Lagrangian proximal alternating method for sparse discrete optimization problems (Q2299205) (← links)
• Delay-constrained shortest paths: approximation algorithms and second-order cone models (Q2342143) (← links)
• Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems (Q2393069) (← links)
• Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming (Q2666655) (← links)
• Perspective Reformulations of the CTA Problem with <i>L</i>₂ Distances (Q2931708) (← links)
• Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach (Q2940060) (← links)
• Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs (Q4995063) (← links)
• An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems (Q5060779) (← links)
• A Scalable Algorithm for Sparse Portfolio Selection (Q5087719) (← links)
• Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs (Q5108255) (← links)
• A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (Q5158761) (← links)
• Quadratic Convex Reformulations for Semicontinuous Quadratic Programming (Q5348460) (← links)
• A new perspective on low-rank optimization (Q6052053) (← links)
• A computational study of perspective cuts (Q6062884) (← links)