Perspective Reformulation and Applications
From MaRDI portal
Publication:2897294
DOI10.1007/978-1-4614-1927-3_3zbMath1242.90134MaRDI QIDQ2897294
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_3
Related Items
Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, Approximated perspective relaxations: a project and lift approach, Benders decomposition without separability: a computational study for capacitated facility location problems, An improved formulation for the maximum coverage patrol routing problem, A perspective-based convex relaxation for switched-affine optimal control, An exact algorithm for a resource allocation problem in mobile wireless communications, Extended formulations in mixed integer conic quadratic programming, Quadratic cone cutting surfaces for quadratic programs with on-off constraints, On speed scaling via integer programming, Polyhedral approximation in mixed-integer convex optimization, Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation, Delay-constrained shortest paths: approximation algorithms and second-order cone models, Locally ideal formulations for piecewise linear functions with indicator variables, Perspective Reformulations of the CTA Problem with L2 Distances, Extended Formulations in Mixed-Integer Convex Programming
Cites Work
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Lectures on Modern Convex Optimization
- Large-Scale Portfolio Optimization
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Large-Scale Network Topological Optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Bimatrix Equilibrium Points and Mathematical Programming
