Pages that link to "Item:Q517311"
From MaRDI portal
The following pages link to How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311):
Displaying 26 items.
- On sublinear inequalities for mixed integer conic programs (Q312706) (← links)
- Two-term disjunctions on the second-order cone (Q896297) (← links)
- Intersection cuts for convex mixed integer programs from translated cones (Q1751221) (← links)
- The generalized trust region subproblem: solution complexity and convex hull results (Q2118085) (← links)
- Ideal formulations for constrained convex optimization problems with indicator variables (Q2118117) (← links)
- Maximal quadratic-free sets (Q2118125) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- A new framework to relax composite functions in nonlinear programs (Q2235154) (← links)
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
- On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
- Maximal Quadratic-Free Sets (Q5041754) (← links)
- On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← links)
- On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables (Q5041763) (← links)
- On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations (Q5072594) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
- The Convex Hull of a Quadratic Constraint over a Polytope (Q5131962) (← links)
- Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem (Q5231678) (← links)
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants (Q5348458) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5918425) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective (Q6057717) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Convex hull results on quadratic programs with non-intersecting constraints (Q6126659) (← links)
- Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity (Q6136657) (← links)
