Univariate parameterization for global optimization of mixed-integer polynomial problems
From MaRDI portal
Publication:2355892
DOI10.1016/J.EJOR.2013.03.042zbMATH Open1317.90213DBLPjournals/eor/TelesCM13OpenAlexW2070416322WikidataQ57563452 ScholiaQ57563452MaRDI QIDQ2355892FDOQ2355892
J. Teles, Henrique A. Matos, Pedro M. Castro
Publication date: 28 July 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10400.9/2447
Recommendations
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Discretization and global optimization for mixed integer bilinear programming
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
Cites Work
- Global optimization with polynomials and the problem of moments
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A collection of test problems for constrained global optimization algorithms
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- A polyhedral branch-and-cut approach to global optimization
- Minimizing polynomials via sum of squares over the gradient ideal
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Class of global minimum bounds of polynomial functions
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Pseudo-Boolean Programming
- Mixed-integer bilinear programming problems
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Exploiting equalities in polynomial programming
- Test examples for nonlinear programming codes
- Handbook of test problems in local and global optimization
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- Global optimization of nonconvex factorable programming problems
- An approximate approach of global optimization for polynomial programming problems
- Cluster Analysis and Mathematical Programming
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables
- Some transformation techniques with applications in global optimization
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Global Optimization of Mixed-Integer Signomial Programming Problems
- Convex underestimation strategies for signomial functions
- Towards strong duality in integer programming
- Title not available (Why is that?)
- On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
- Sparsity in sums of squares of polynomials
- Global optimization of nonconvex polynomial programming problems having rational exponents
- On Solving Polynomial, Factorable, and Black-Box Optimization Problems Using the RLT Methodology
- A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Title not available (Why is that?)
- Biconvex Models and Algorithms for Risk Management Problems
- An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs
- An exact penalty function approach for nonlinear integer programming problems
- Capital Expenditure Programming and Some Alternative Approaches to Risk
- Polynomial Programming: LP-Relaxations Also Converge
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming
- A revised Taha's algorithm for polynomial 0-1 programming
Cited In (8)
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique
- Sequence of polyhedral relaxations for nonlinear univariate functions
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables
- Unconstrained and constrained global optimization of polynomial functions in one variable
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
Uses Software
This page was built for publication: Univariate parameterization for global optimization of mixed-integer polynomial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355892)
