Projected perspective reformulations with applications in design problems
From MaRDI portal
Recommendations
- Approximated perspective relaxations: a project and lift approach
- Perspective reformulation and applications
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
Cited in
(31)- Improving the approximated projected perspective reformulation by dual information
- Approximated perspective relaxations: a project and lift approach
- QPLIB: a library of quadratic programming instances
- Projected slabs: approximation of perspective projection and error analysis
- Delay-constrained routing problems: accurate scheduling models and admission control
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Deep Neural Networks Pruning via the Structured Perspective Regularization
- Structured pruning of neural networks for constraints learning
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint
- A conic quadratic formulation for a class of convex congestion functions in network flow problems
- scientific article; zbMATH DE number 5524258 (Why is no real title available?)
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
- Outlier detection in time series via mixed-integer conic quadratic optimization
- Perspective reformulation and applications
- A computational study of perspective cuts
- Minimum cost paths over dynamic networks
- Delay-constrained shortest paths: approximation algorithms and second-order cone models
- A library for continuous convex separable quadratic knapsack problems
- A fast global algorithm for multi-linearly constrained separable binary quadratic program
- The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables
- Reformulations of separable quadratic optimization problems with symmetric structures via variable aggregation
- On the convexification of constrained quadratic optimization problems with indicator variables
- Quadratic convex reformulations for semicontinuous quadratic programming
- Ideal formulations for constrained convex optimization problems with indicator variables
- A polynomial-time algorithm with tight error bounds for single-period unit commitment problem
- A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters
- Perspective reformulations of the CTA problem with L₂ distances
- Strengthening the sequential convex MINLP technique by perspective reformulations
- Extended formulations in mixed integer conic quadratic programming
- Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming
This page was built for publication: Projected perspective reformulations with applications in design problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879518)
