Perspective reformulation and applications
From MaRDI portal
Publication:2897294
DOI10.1007/978-1-4614-1927-3_3zbMATH Open1242.90134OpenAlexW2286092420MaRDI QIDQ2897294FDOQ2897294
Authors: Oktay Günlük, Jeff Linderoth 
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
Recommendations
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Approximated perspective relaxations: a project and lift approach
- Projected perspective reformulations with applications in design problems
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- An improved branch and bound algorithm for mixed integer nonlinear programs
- 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
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Bimatrix Equilibrium Points and Mathematical Programming
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Large-Scale Portfolio Optimization
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Large-Scale Network Topological Optimization
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
Cited In (41)
- Perspective, a visionary process: The main generative road for crossing dimensions
- Improving the approximated projected perspective reformulation by dual information
- Polyhedral approximation in mixed-integer convex optimization
- Approximated perspective relaxations: a project and lift approach
- Minimizing a sum of clipped convex functions
- Using \(\ell^p\)-norms for fairness in combinatorial optimisation
- Wu's method and its application to perspective viewing
- A unified approach to mixed-integer optimization problems with logical constraints
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Scalable algorithms for the sparse ridge regression
- Bi-perspective functions for mixed-integer fractional programs with indicator variables
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- The p-hub centre routing problem with emissions budget: formulation and solution procedure
- Gaining or Losing Perspective for Convex Multivariate Functions on a Simplex
- A fast exact method for the capacitated facility location problem with differentiable convex production costs
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- Complex portfolio selection via convex mixed‐integer quadratic programming: a survey
- An improved formulation for the maximum coverage patrol routing problem
- A computational study of perspective cuts
- Alternate second order conic program reformulations for hub location under stochastic demand and congestion
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- Benders decomposition without separability: a computational study for capacitated facility location problems
- On speed scaling via integer programming
- Delay-constrained shortest paths: approximation algorithms and second-order cone models
- Extended formulations in mixed-integer convex programming
- A perspective-based convex relaxation for switched-affine optimal control
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Projected perspective reformulations with applications in design problems
- Locally ideal formulations for piecewise linear functions with indicator variables
- Minotaur: a mixed-integer nonlinear optimization toolkit
- An exact algorithm for a resource allocation problem in mobile wireless communications
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- Outer approximation with conic certificates for mixed-integer convex problems
- Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization
- A Scalable Algorithm for Sparse Portfolio Selection
- Perspective reformulations of the CTA problem with \(L_2\) distances
- Extended formulations in mixed integer conic quadratic programming
- Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions
- Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions
This page was built for publication: Perspective reformulation and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897294)
