On refinement strategies for solving MINLPs by piecewise linear relaxations: a generalized red refinement

DOI10.1007/S11590-021-01740-1MaRDI QIDQ2115319zbMATH OpenOpenAlexFDO

Authors Robert Burlacu

Publication date 15 March 2022

Published in Optimization Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11590-021-01740-1

zbMATH Keywords

mixed integer nonlinear programmingincremental methodred refinementpiecewise linear relaxation

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• Relaxation methods for strictly convex regularizations of piecewise linear programs
• A class of generalized multisplitting relaxation methods for linear complementarity problems
• A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities
• Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
• Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems
• A potential reduction method for the generalized linear complementarity problem over a polyhedral cone
• Reformulations for utilizing separability when solving convex MINLP problems
• A note on resolving infeasibility in linear programs by constraint relaxation
• A potential reduction algorithm for generalized linear complementarity problem over a polyhedral cone

Cites work

• A reformulation framework for global optimization
• Continuous piecewise linear delta-approximations for bivariate and multivariate functions
• Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems
• Mixed integer models for the stationary case of gas network optimization
• Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
• On the Solution of Discrete Programming Problems
• Optimistic MILP modeling of non-linear optimization problems
• Piecewise-linear approximations of multidimensional functions
• Polyhedral methods for piecewise-linear functions. I: The lambda method
• Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes
• Simplizialzerlegungen von beschränkter Flachheit
• Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
• Towards simulation based mixed‐integer optimization with differential equations
• Using Piecewise Linear Functions for Solving MINLPs

Cited in

(2)

• Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
• An approximation algorithm for optimal piecewise linear interpolations of bounded variable products

Describes a project that uses

Uses Software

• NESTA
• Gurobi

This page was built for publication: On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115319)