Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
From MaRDI portal
Publication:3503836
DOI10.1007/978-3-540-68891-4_1zbMath1143.90364OpenAlexW2157195803MaRDI QIDQ3503836
Publication date: 10 June 2008
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_1
Related Items
Minotaur: a mixed-integer nonlinear optimization toolkit, Inversion of convection-diffusion equation with discrete sources, A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes, Perspective Reformulation and Applications, Perspective reformulations of mixed integer nonlinear programs with indicator variables, Perspective Reformulations of the CTA Problem with L2 Distances, A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function, Extended formulations in mixed integer conic quadratic programming, Convex envelopes generated from finitely many compact convex sets, Lift-and-project cuts for convex mixed integer nonlinear programs, Demand allocation with latency cost functions, Mixed-integer nonlinear programs featuring ``on/off constraints, Improving the approximated projected perspective reformulation by dual information, A critical review of discrete filled function methods in solving nonlinear discrete optimization problems, Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion, Approximated perspective relaxations: a project and lift approach
Uses Software
Cites Work
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- An algorithmic framework for convex mixed integer nonlinear programs
- An improved branch and bound algorithm for mixed integer nonlinear programs
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Computational study of a family of mixed-integer quadratic programming problems
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Cuts for mixed 0-1 conic programming
- Lectures on Modern Convex Optimization
- Large-Scale Portfolio Optimization
- Large-Scale Network Topological Optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints
- Cuts for Conic Mixed-Integer Programming
