A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
From MaRDI portal
Publication:2181606
DOI10.1007/s10589-020-00176-0zbMath1453.90119OpenAlexW3011086201MaRDI QIDQ2181606
Ignacio E. Grossmann, Kevin C. Furman, Nicolas W. Sawaya
Publication date: 19 May 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-020-00176-0
Related Items (4)
A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function ⋮ A computational study of perspective cuts ⋮ Comparison of MINLP formulations for global superstructure optimization ⋮ A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables
Uses Software
Cites Work
- Unnamed Item
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Representability in mixed integer programming. I: Characterization results
- Disjunctive programming: Properties of the convex hull of feasible points
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Lift-and-project cuts for convex mixed integer nonlinear programs
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- On mathematical programming with indicator constraints
- 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
- Projected Perspective Reformulations with Applications in Design Problems
- Perspective Reformulation and Applications
- Lift-and-Project Cuts for Mixed Integer Convex Programs
- Cutting Plane Algorithm for Convex Generalized Disjunctive Programs
- 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
- Disjunctive Programming
- Pyomo -- optimization modeling in Python
This page was built for publication: A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
