# Sequence of Polyhedral Relaxations for Nonlinear Univariate Functions

@article{Sundar2020SequenceOP, title={Sequence of Polyhedral Relaxations for Nonlinear Univariate Functions}, author={K. Sundar and S. Sanjeevi and H. Nagarajan}, journal={arXiv: Optimization and Control}, year={2020} }

The letter develops a sequence of Mixed Integer Linear Programming (MILP) and Linear Programming (LP) relaxations that converge to the graph of a nonlinear, univariate, bounded, and differentiable function $f(x)$ and its convex hull, respectively. Theoretical convergence of the sequence of relaxations to the graph of the function and its convex hull is established. These relaxations can be used in MILP-based global optimization algorithms for nonlinear non-convex optimization problems.

#### References

SHOWING 1-10 OF 35 REFERENCES

AN ALGORITHMIC FRAMEWORK FOR MINLP WITH SEPARABLE NON-CONVEXITY

- Computer Science, Mathematics
- 2012

Piecewise Polyhedral Formulations for a Multilinear Term

- Computer Science, Mathematics
- Oper. Res. Lett.
- 2021

Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming

- Computer Science, Mathematics
- 2002

Global optimization of MIQCPs with dynamic piecewise relaxations

- Mathematics, Computer Science
- J. Glob. Optim.
- 2018

Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions

- Mathematics
- 1980

Computing tight bounds via piecewise linear functions through the example of circle cutting problems

- Mathematics, Computer Science
- Math. Methods Oper. Res.
- 2016

Tight Piecewise Convex Relaxations for Global Optimization of Optimal Power Flow

- Computer Science, Mathematics
- 2018 Power Systems Computation Conference (PSCC)
- 2018

Univariate parameterization for global optimization of mixed-integer polynomial problems

- Mathematics, Computer Science
- Eur. J. Oper. Res.
- 2013