Subgradient based outer approximation for mixed integer second order cone programming
From MaRDI portal
Publication:2897293
DOI10.1007/978-1-4614-1927-3_2zbMATH Open1242.90130OpenAlexW181437557MaRDI QIDQ2897293FDOQ2897293
Authors: Sarah Drewes, Stefan Ulbrich 
Publication date: 10 July 2012
Published in: Mixed Integer Nonlinear Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-1927-3_2
Recommendations
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Outer approximation with conic certificates for mixed-integer convex problems
- Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability
- Mixed integer second order cone programming.
- scientific article; zbMATH DE number 7708795
Cites Work
- Title not available (Why is that?)
- Convex Analysis
- An algorithmic framework for convex mixed integer nonlinear programs
- Solving mixed integer nonlinear programs by outer approximation
- Second-order cone programming
- A branch-and-cut method for 0-1 mixed convex programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Generalized Benders decomposition
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- On Polyhedral Approximations of the Second-Order Cone
- Title not available (Why is that?)
- Algorithm for cardinality-constrained quadratic optimization
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
- Mixed integer second order cone programming.
- Cuts for mixed 0-1 conic programming
- Cuts for Conic Mixed-Integer Programming
- Generating convex polynomial inequalities for mixed 0-1 programs
- A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ
Cited In (18)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- Title not available (Why is that?)
- On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs
- Conic relaxation approaches for equal deployment problems
- Smoothing and regularization for mixed-integer second-order cone programming with applications in portfolio optimization
- Inversion of convection-diffusion equation with discrete sources
- A quadratically convergent sequential programming method for second-order cone programs capable of warm starts
- Convexification of queueing formulas by mixed-integer second-order cone programming: an application to a discrete location problem with congestion
- Extended formulations in mixed-integer convex programming
- Equity in genetic newborn screening
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Outer approximation for pseudo-convex mixed-integer nonlinear program problems
- Outer approximation with conic certificates for mixed-integer convex problems
- Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming
- An active-set method for second-order conic-constrained quadratic programming
Uses Software
This page was built for publication: Subgradient based outer approximation for mixed integer second order cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897293)
