Imagen de Portada

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Göß, Adrian
Formato:	Preprint
Publicado:	2026
Materias:	Optimization and Control 90C11, 90C20, 90C26, 90C30
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

An extension of an RLT-based solver to MINLP polynomial problems
por: González-Díaz, Julio, et al.
Publicado: (2024)

Norm-induced Cuts: Outer Approximation for Lipschitzian Constraint Functions
por: Göß, Adrian, et al.
Publicado: (2024)

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

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

Hidden convexity of quadratic systems and its application to quadratic programming
por: Huy, Nguyen Quang, et al.
Publicado: (2026)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
por: Qu, Zheng, et al.
Publicado: (2023)

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

Separable QCQPs and Their Exact SDP Relaxations
por: Kojima, Masakazu, et al.
Publicado: (2026)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
por: Kojima, Masakazu, et al.
Publicado: (2025)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
por: Kojima, Masakazu, et al.
Publicado: (2025)

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

A Globally Convergent Gradient Method with Momentum
por: Lapucci, Matteo, et al.
Publicado: (2024)

Conductance Estimation in Digraphs: Submodular Transformation, Lovász Extension and Dinkelbach Iteration
por: Shao, Sihong, et al.
Publicado: (2025)

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

Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
por: de Brito, José, et al.
Publicado: (2025)

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

On the Convexity of the Solution Set of Linear Complementarity Problem over Tensor Spaces
por: Sharma, Sonali, et al.
Publicado: (2026)

Star Quasiconvexity: a Unified Approach for Linear Convergence of First-Order Methods Beyond Convexity
por: Khanh, Phan Quoc, et al.
Publicado: (2025)

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
por: Tauheed, et al.
Publicado: (2026)

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions
por: Cesaroni, Edoardo, et al.
Publicado: (2026)

Optimization over convex polyhedra via Hadamard parametrizations
por: Tang, Tianyun, et al.
Publicado: (2024)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
por: Quintero, Rodolfo A., et al.
Publicado: (2024)

Effective Front-Descent Algorithms with Convergence Guarantees
por: Lapucci, Matteo, et al.
Publicado: (2024)

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

A Surrogate Value Function Formulation for Bilevel Optimization
por: Xu, Mengwei, et al.
Publicado: (2025)

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
por: Higuchi, Rei, et al.
Publicado: (2024)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
por: Cecere, Francesco, et al.
Publicado: (2025)

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

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

Riemannian Gradient Method with Momentum
por: Leggio, Filippo, et al.
Publicado: (2026)

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
por: Xie, Yue, et al.
Publicado: (2025)

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers
por: Menickelly, Matt, et al.
Publicado: (2023)

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
por: McRae, Andrew D., et al.
Publicado: (2023)

A minimal face constant rank constraint qualification for reducible conic programming
por: Andreani, Roberto, et al.
Publicado: (2023)

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

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
por: de Brito, Jose, et al.
Publicado: (2026)

A heavy-ball type curve search method for smooth convexly constrained optimization
por: Donnini, Federica, et al.
Publicado: (2026)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
por: Alcantara, Jan Harold, et al.
Publicado: (2024)