A computational study of perspective cuts (Q6062884)

scientific article; zbMATH DE number 7773204

Language	Label	Description	Also known as
English	A computational study of perspective cuts	scientific article; zbMATH DE number 7773204

Statements

instance of

scholarly article

0 references

title

A computational study of perspective cuts (English)

0 references

0 references

0 references

0 references

Mathematical Programming Computation

0 references

publication date

2 December 2023

0 references

full work available at URL

https://arxiv.org/abs/2103.09573

0 references

zbMATH Keywords

perspective cuts

0 references

mixed integer nonlinear programming

0 references

nonconvex optimization

0 references

computational study

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A strong conic quadratic reformulation for machine-job assignment with controllable processing times

0 references

Strong formulations for quadratic optimization with M-matrices and indicator variables

0 references

Disjunctive Programming

0 references

Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems

0 references

Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching

0 references

MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming

0 references

Convex programming for disjunctive convex optimization

0 references

Benchmarking optimization software with performance profiles.

0 references

Approximated perspective relaxations: a project and lift approach

0 references

Improving the approximated projected perspective reformulation by dual information

0 references

Perspective cuts for a class of convex 0-1 mixed integer programs

0 references

SDP diagonalizations and perspective cuts for a class of nonseparable MIQP

0 references

A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes

0 references

Projected Perspective Reformulations with Applications in Design Problems

0 references

Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs

0 references

QPLIB: a library of quadratic programming instances

0 references

A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function

0 references

Strong formulations for conic quadratic optimization with indicator variables

0 references

Generalized convex disjunctive programming: Nonlinear convex hull relaxation

0 references

Perspective reformulations of mixed integer nonlinear programs with indicator variables

0 references

Perspective Reformulation and Applications

0 references

Q2861546

0 references

Mixed-integer nonlinear programs featuring ``on/off'' constraints

0 references

The Cutting-Plane Method for Solving Convex Programs

0 references

Convex envelopes generated from finitely many compact convex sets

0 references

Alternating current optimal power flow with generator selection

0 references

A branch-and-cut method for 0-1 mixed convex programming

0 references

Strong valid inequalities for orthogonal disjunctions and bilinear covering sets

0 references

Convex extensions and envelopes of lower semi-continuous functions

0 references

On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming

0 references

The reformulation of two mixed integer programming problems

0 references

Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach

0 references

Identifiers

zbMATH Open document ID

0 references

0 references

10.1007/s12532-023-00246-4

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6062884