Pages that link to "Item:Q263157"

The following pages link to Approximated perspective relaxations: a project and lift approach (Q263157):

Displaying 21 items.

• Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
• Improving the approximated projected perspective reformulation by dual information (Q1728322) (← links)
• Strong formulations for conic quadratic optimization with indicator variables (Q2039236) (← links)
• Ideal formulations for constrained convex optimization problems with indicator variables (Q2118117) (← links)
• Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization (Q2231331) (← links)
• QPLIB: a library of quadratic programming instances (Q2281448) (← links)
• Strengthening the sequential convex MINLP technique by perspective reformulations (Q2311102) (← links)
• A polynomial-time algorithm with tight error bounds for single-period unit commitment problem (Q2687676) (← links)
• Perspective Reformulations of the CTA Problem with <i>L</i>₂ Distances (Q2931708) (← links)
• Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs (Q4995063) (← 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 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)
• Relaxation schemes for mathematical programmes with switching constraints (Q5865340) (← links)
• A computational study of perspective cuts (Q6062884) (← links)
• Complex portfolio selection via convex mixed‐integer quadratic programming: a survey (Q6070970) (← links)
• Deep Neural Networks Pruning via the Structured Perspective Regularization (Q6148352) (← links)