On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement
type: Item
instance of: scholarly article
title: On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement
zbMATH Open document ID: 1487.90484
author: Robert Burlacu
published in: Optimization Letters
publication date: 2022-03-15T00:00:00Z
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 7490498
zbMATH Keywords: mixed integer nonlinear programming
zbMATH Keywords: red refinement
zbMATH Keywords: piecewise linear relaxation
zbMATH Keywords: incremental method
describes a project that uses: NESTA
describes a project that uses: Gurobi
MaRDI profile type: Publication
full work available at URL: s11590-021-01740-1
OpenAlex ID: W3174419237
cites work: Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes
cites work: Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
cites work: Simplizialzerlegungen von beschränkter Flachheit
cites work: Using Piecewise Linear Functions for Solving MINLPs
cites work: Towards simulation based mixed‐integer optimization with differential equations
cites work: Polyhedral methods for piecewise-linear functions. I: The lambda method
cites work: A reformulation framework for global optimization
cites work: On the Solution of Discrete Programming Problems
cites work: Mixed integer models for the stationary case of gas network optimization
cites work: Piecewise-linear approximations of multidimensional functions
cites work: Continuous piecewise linear delta-approximations for bivariate and multivariate functions
cites work: Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems
cites work: Optimistic MILP modeling of non-linear optimization problems
cites work: Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
DOI: 10.1007/S11590-021-01740-1
Recommended article: Relaxation methods for strictly convex regularizations of piecewise linear programs
Recommended article: A class of generalized multisplitting relaxation methods for linear complementarity problems
Recommended article: A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities
Recommended article: Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
Recommended article: Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems
Recommended article: A potential reduction method for the generalized linear complementarity problem over a polyhedral cone
Recommended article: Reformulations for utilizing separability when solving convex MINLP problems
Recommended article: A note on resolving infeasibility in linear programs by constraint relaxation
Recommended article: Q5851080
description: scientific article; zbMATH DE number 7490498