Copertina

Parabolic Approximation & Relaxation for MINLP

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Göß, Adrian, Burlacu, Robert, Martin, Alexander
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control 90C11, 90C20, 90C26, 90C30
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Riemannian Gradient Method with Momentum
di: Leggio, Filippo, et al.
Pubblicazione: (2026)

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

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

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

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

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

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

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