Approximated perspective relaxations: a project and lift approach
From MaRDI portal
(Redirected from Publication:263157)
Recommendations
- Projected perspective reformulations with applications in design problems
- Perspective reformulation and applications
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Improving the approximated projected perspective reformulation by dual information
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
Cites work
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A branch-and-cut method for 0-1 mixed convex programming
- A bundle-type algorithm for routing in telecommunication data networks
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- A library for continuous convex separable quadratic knapsack problems
- A polyhedral branch-and-cut approach to global optimization
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Convex envelopes generated from finitely many compact convex sets
- Convex extensions and envelopes of lower semi-continuous functions
- Convex programming for disjunctive convex optimization
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- Delay-constrained shortest paths: approximation algorithms and second-order cone models
- Demand allocation with latency cost functions
- Explicit convex and concave envelopes through polyhedral subdivisions
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- Large-scale unit commitment under uncertainty
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Mixed integer nonlinear programs featuring ``on/off constraints: convex analysis and applications
- Mixed-integer bilinear programming problems
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Perspective reformulation and applications
- Projected perspective reformulations with applications in design problems
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
Cited in
(25)- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Deep Neural Networks Pruning via the Structured Perspective Regularization
- Perspective reformulation and applications
- A computational study of perspective cuts
- Minotaur: a mixed-integer nonlinear optimization toolkit
- On the convexification of constrained quadratic optimization problems with indicator variables
- Quadratic convex reformulations for semicontinuous quadratic programming
- Strong formulations for conic quadratic optimization with indicator variables
- Projected perspective reformulations with applications in design problems
- A polynomial-time algorithm with tight error bounds for single-period unit commitment problem
- Cardinality minimization, constraints, and regularization: a survey
- Improving the approximated projected perspective reformulation by dual information
- Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs
- Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization
- Complex portfolio selection via convex mixed‐integer quadratic programming: a survey
- Ideal formulations for constrained convex optimization problems with indicator variables
- A Scalable Algorithm for Sparse Portfolio Selection
- Outlier detection in time series via mixed-integer conic quadratic optimization
- Perspective reformulations of the CTA problem with \(L_2\) distances
- QPLIB: a library of quadratic programming instances
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
- Strengthening the sequential convex MINLP technique by perspective reformulations
- A unified approach to mixed-integer optimization problems with logical constraints
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems
- Relaxation schemes for mathematical programmes with switching constraints
This page was built for publication: Approximated perspective relaxations: a project and lift approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q263157)
