On Polyhedral Approximations of the Second-Order Cone
From MaRDI portal
Publication:5704033
DOI10.1287/moor.26.2.193.10561zbMath1082.90133OpenAlexW2107395148WikidataQ57392940 ScholiaQ57392940MaRDI QIDQ5704033
Aharon Ben-Tal, Arkadi Nemirovski
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.26.2.193.10561
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
An uncertainty management framework for industrial applications, Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, THE MAGIC OF NASH SOCIAL WELFARE IN OPTIMIZATION: DO NOT SUM, JUST MULTIPLY!, Heuristics for exact nonnegative matrix factorization, Lifting for Simplicity: Concise Descriptions of Convex Sets, Tractable approximate robust geometric programming, A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach, Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming, Approximation Limits of Linear Programs (Beyond Hierarchies), Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion, A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization, A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints, Sparse and robust mean-variance portfolio optimization problems, Common information and unique disjointness, Polyhedral approximations inp-order cone programming, Exact and approximation algorithms for a soft rectangle packing problem, A robust optimization of capacity allocation policies in the third-party warehouse, Extension complexity of low-dimensional polytopes, Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization, On representing the positive semidefinite cone using the second-order cone, Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms, Solving multiplicative programs by binary-encoding the multiplication operation, Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design, Extended formulations in mixed integer conic quadratic programming, A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach, A robust optimization formulation for dynamic pricing of a web service with limited total shared capacity, On Ranks of Regular Polygons, Lifting for conic mixed-integer programming, Elliptic polytopes and invariant norms of linear operators, Outer approximation with conic certificates for mixed-integer convex problems, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, The robust minimum cost consensus model with risk aversion, Consistent approximations in composite optimization, Semidefinite Approximation of Closed Convex Set, Submodularity in Conic Quadratic Mixed 0–1 Optimization, On approximatingD-induced polar sets of geometric and extended geometric cones, On approximating D-induced polar sets of a second-order cone by an ellipsoid, Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations, On approximation by projections of polytopes with few facets, A guide to conic optimisation and its applications, Optimality conditions for the simple convex bilevel programming problem in Banach spaces, Semidefinite approximations of the matrix logarithm, Solving limit analysis problems: an interior-point method, Constructing Extended Formulations from Reflection Relations, Relative entropy optimization and its applications, On the linear extension complexity of regular \(n\)-gons, Some upper and lower bounds on PSD-rank, Mixed integer programming with a class of nonlinear convex constraints, Intersection cuts for convex mixed integer programs from translated cones, Optimization over structured subsets of positive semidefinite matrices via column generation, Polymatroids and mean-risk minimization in discrete optimization, On valid inequalities for mixed integer \(p\)-order cone programming, On the geometric interpretation of the nonnegative rank, Distributed robust optimization (DRO). I: Framework and example, Polygons as sections of higher-dimensional polytopes, Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization, Higher moment coherent risk measures, Robust linear optimization under general norms., Ductile failure of cylindrically porous materials. II: Other cases of symmetry, Extended formulations in combinatorial optimization, Logarithmic reduction of the level of randomness in some probabilistic geometric constructions, Projecting \(l_{\infty}\) onto classical spaces, Extended formulations for polygons, Explicit polyhedral approximation of the Euclidean ball, Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations, A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs, Using Rademacher permutations to reduce randomness, Insurance with multiple insurers: a game-theoretic approach, A globally convergent non-interior point algorithm with full Newton step for second-order cone programming, Conic programming models for production planning with clearing functions: formulations and duality, Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study, Erratum to: ``Polyhedral approximation of ellipsoidal uncertainty sets via extended formulations: a computational case study, Approximation of convex functions by projections of polyhedra, Rational polyhedral outer-approximations of the second-order cone, Variable Speed in Vertical Flight Planning, Minimal conic quadratic reformulations and an optimization model, Mixed Integer Linear Programming Formulation Techniques, Fitting tractable convex sets to support function evaluations, Conic relaxation approaches for equal deployment problems, On the existence of 0/1 polytopes with high semidefinite extension complexity, Risk optimization with \(p\)-order conic constraints: a linear programming approach, Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems, Limit analysis and Gurson's model, Second-Order Cone Representation for Convex Sets in the Plane, Special issue: Global solution of integer, stochastic and nonconvex optimization problems, Unnamed Item, On Polyhedral Approximations of the Positive Semidefinite Cone, On \(p\)-norm linear discrimination, Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization
