Pages that link to "Item:Q5704033"

The following pages link to On Polyhedral Approximations of the Second-Order Cone (Q5704033):

Displaying 50 items.

• Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization (Q263209) (← links)
• Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
• Common information and unique disjointness (Q343843) (← links)
• On approximation by projections of polytopes with few facets (Q476495) (← links)
• Relative entropy optimization and its applications (Q507310) (← links)
• On the linear extension complexity of regular \(n\)-gons (Q513256) (← links)
• Some upper and lower bounds on PSD-rank (Q517316) (← links)
• Lifting for conic mixed-integer programming (Q623366) (← links)
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
• Robust linear optimization under general norms. (Q703272) (← links)
• Extended formulations for polygons (Q714985) (← links)
• Insurance with multiple insurers: a game-theoretic approach (Q723965) (← links)
• On the existence of 0/1 polytopes with high semidefinite extension complexity (Q745683) (← links)
• Tractable approximate robust geometric programming (Q833439) (← links)
• Polymatroids and mean-risk minimization in discrete optimization (Q957370) (← links)
• A globally convergent non-interior point algorithm with full Newton step for second-order cone programming (Q993313) (← links)
• Risk optimization with \(p\)-order conic constraints: a linear programming approach (Q1038319) (← links)
• Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
• A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
• A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints (Q1652440) (← links)
• A robust optimization of capacity allocation policies in the third-party warehouse (Q1666624) (← links)
• Extended formulations in mixed integer conic quadratic programming (Q1688453) (← links)
• Semidefinite approximations of the matrix logarithm (Q1740571) (← links)
• Mixed integer programming with a class of nonlinear convex constraints (Q1751218) (← links)
• Intersection cuts for convex mixed integer programs from translated cones (Q1751221) (← links)
• Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
• On the geometric interpretation of the nonnegative rank (Q1758469) (← links)
• Ductile failure of cylindrically porous materials. II: Other cases of symmetry (Q1767592) (← links)
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
• Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study (Q1789594) (← links)
• Erratum to: ``Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study'' (Q1789609) (← links)
• Conic programming models for production planning with clearing functions: formulations and duality (Q2030464) (← links)
• Rational polyhedral outer-approximations of the second-order cone (Q2042079) (← links)
• Fitting tractable convex sets to support function evaluations (Q2046436) (← links)
• Special issue: Global solution of integer, stochastic and nonconvex optimization problems (Q2097627) (← links)
• Sparse and robust mean-variance portfolio optimization problems (Q2158966) (← links)
• Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← links)
• On valid inequalities for mixed integer \(p\)-order cone programming (Q2251546) (← links)
• Distributed robust optimization (DRO). I: Framework and example (Q2254178) (← links)
• Polygons as sections of higher-dimensional polytopes (Q2256121) (← links)
• Projecting \(l_{\infty}\) onto classical spaces (Q2272172) (← links)
• Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations (Q2274883) (← links)
• Minimal conic quadratic reformulations and an optimization model (Q2294364) (← links)
• Conic relaxation approaches for equal deployment problems (Q2297663) (← links)
• On \(p\)-norm linear discrimination (Q2356201) (← links)
• An uncertainty management framework for industrial applications (Q2358143) (← links)
• On representing the positive semidefinite cone using the second-order cone (Q2414901) (← links)
• Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design (Q2419563) (← links)
• Logarithmic reduction of the level of randomness in some probabilistic geometric constructions (Q2491601) (← links)
• Approximation of convex functions by projections of polyhedra (Q2513165) (← links)