Cover Image

An extension of an RLT-based solver to MINLP polynomial problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	González-Díaz, Julio, González-Rodríguez, Brais, Rodríguez-Acevedo, Iria
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C26, 90C23, 90C11
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
by: González-Díaz, Julio, et al.
Published: (2025)

Parabolic Approximation & Relaxation for MINLP
by: Göß, Adrian, et al.
Published: (2024)

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms
by: Bestuzheva, Ksenia, et al.
Published: (2022)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
by: Göß, Adrian
Published: (2026)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
by: Slot, Lucas, et al.
Published: (2024)

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
by: Slot, Lucas
Published: (2021)

Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
by: Yildirim, E. Alper
Published: (2025)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
by: Gómez-Casares, Ignacio, et al.
Published: (2025)

Outer Approximation Scheme for Weakly Convex Constrained Optimization Problems
by: Bednarczuk, Ewa M., et al.
Published: (2024)

Exploiting Sign Symmetries in Minimizing Sums of Rational Functions
by: Guo, Feng, et al.
Published: (2024)

Sparse Polynomial Optimization with Unbounded Sets
by: Huang, Lei, et al.
Published: (2024)

Sparse Polynomial Matrix Optimization
by: Miller, Jared, et al.
Published: (2024)

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
by: Guo, Feng, et al.
Published: (2023)

Sparse convex relaxations in polynomial optimization
by: Averkov, Gennadiy, et al.
Published: (2024)

A Frank-Wolfe-based primal heuristic for quadratic mixed-integer optimization
by: Mexi, Gioni, et al.
Published: (2025)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
by: Lapucci, Matteo, et al.
Published: (2024)

A Unifying Convexification Framework for Chance-Constrained Programs via Bilinear Extended Formulations over a Simplex
by: Davarnia, Danial, et al.
Published: (2025)

A Bilevel Hierarchy of Strengthened Complex Moment Relaxations for Complex Polynomial Optimization
by: Wang, Jie
Published: (2024)

On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
by: Nishioka, Akatsuki, et al.
Published: (2023)

Warm-starting outer approximation for parametrized convex MINLP
by: Tamm, Erik, et al.
Published: (2025)

Multivariate approximation by polynomial and generalised rational functions
by: Millán, R. Díaz, et al.
Published: (2021)

Convex quadratic sets and the complexity of mixed integer convex quadratic programming
by: Del Pia, Alberto
Published: (2023)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
by: Marumo, Hiroki, et al.
Published: (2024)

Non-SOS Positivstellensätze for semi-algebraic sets defined by polynomial matrix inequalities
by: Guo, Feng
Published: (2025)

Minimizing and Maximizing the Shannon Entropy for Fixed Marginals
by: Franke, Paula, et al.
Published: (2025)

Closing the duality gap of the generalized trace ratio problem
by: Yang, Meijia, et al.
Published: (2024)

Beyond binarity: Semidefinite programming for ternary quadratic problems
by: de Meijer, Frank, et al.
Published: (2026)

Duality attainment and strict feasibility of the generalized moment problem and its relaxations
by: Halaseh, Sami, et al.
Published: (2026)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
by: Ghaffari-Hadigheh, Alireza, et al.
Published: (2022)

Some optimality conditions of set-valued optimization problems in locally convex topological vector spaces
by: Zeng, Renying
Published: (2024)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
by: Borges, Jennifer C., et al.
Published: (2026)

New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
by: Tawarmalani, Mohit
Published: (2024)

An ODE approach to multiple choice polynomial programming
by: Shao, Sihong, et al.
Published: (2022)

Real-time solution of quadratic optimization problems with banded matrices and indicator variables
by: Gomez, Andres, et al.
Published: (2024)

Projection-based curve pattern search for black-box optimization over smooth convex sets
by: Jia, Xiaoxi, et al.
Published: (2025)

An open-source solver for finding global solutions to constrained derivative-free optimization problems
by: Chandramouli, Gannavarapu, et al.
Published: (2024)

Sum-of-squares certificates for symmetric polynomials on the hypercube: a counterexample to a conjecture of De Klerk and Laurent
by: Polak, Sven
Published: (2026)

A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance
by: Nolasco, Eduardo, et al.
Published: (2025)

A parameter-free approach for solving SOS-convex semi-algebraic fractional programs
by: Yang, Chengmiao, et al.
Published: (2024)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
by: Hou, Di, et al.
Published: (2025)