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
Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints, A Scalable Algorithm for Sparse Portfolio Selection, Scalable Algorithms for the Sparse Ridge Regression, A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, A computational study of perspective cuts, Complex portfolio selection via convex mixed‐integer quadratic programming: a survey, The p-hub centre routing problem with emissions budget: formulation and solution procedure, 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, Minotaur: a mixed-integer nonlinear optimization toolkit, 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, A fast exact method for the capacitated facility location problem with differentiable convex production costs, A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function, Outer approximation with conic certificates for mixed-integer convex problems, Minimizing a sum of clipped convex functions, Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization, Bi-perspective functions for mixed-integer fractional programs with indicator variables, Alternate second order conic program reformulations for hub location under stochastic demand and congestion, 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, Using \(\ell^p\)-norms for fairness in combinatorial optimisation, 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
