Copertina

Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Yildirim, E. Alper
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control 90C20, 90C26, 90C05, 90C22, 90C46
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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)

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

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)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
di: Arima, Naohiko, et al.
Pubblicazione: (2024)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
di: Arima, Naohiko, et al.
Pubblicazione: (2023)

Extended Triangle Inequalities for Nonconvex Box-Constrained Quadratic Programming
di: Anstreicher, Kurt M., et al.
Pubblicazione: (2025)

An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c
di: Fujii, Koichi, et al.
Pubblicazione: (2023)

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

New results on the local-nonglobal minimizers of the generalized trust-region subproblem
di: Ai, Wenbao, et al.
Pubblicazione: (2024)

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

Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
di: Bomze, Immanuel, 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)

On the convexity for the range set of two quadratic functions
di: Nguyen, Huu-Quang, et al.
Pubblicazione: (2025)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
di: Nguyen, Vinh
Pubblicazione: (2025)

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

Tight Semidefinite Relaxations for Verifying Robustness of Neural Networks
di: Azuma, Godai, et al.
Pubblicazione: (2025)

Optimality Conditions and Duality for Multiobjective Fractional Bilevel Optimization Problems
di: Lara, Felipe, et al.
Pubblicazione: (2025)

Cardinality-Constrained Multi-Objective Optimization: Novel Optimality Conditions and Algorithms
di: Lapucci, Matteo, et al.
Pubblicazione: (2023)

Algebraic Farkas Lemma and Strong Duality for Perturbed Conic Linear Programming
di: Khanh, P. D., et al.
Pubblicazione: (2026)

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

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
di: Turan, Evren M., et al.
Pubblicazione: (2023)

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

SDP Approach to Quadratic Vertex-Disjoint Paths Problem
di: Xu, Mingming, et al.
Pubblicazione: (2026)

QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs
di: Hermans, Ben, et al.
Pubblicazione: (2020)

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

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
di: Namchaisiri, Charles, et al.
Pubblicazione: (2024)

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

Benchmarking of quantum and classical SDP relaxations for QUBO formulations of real-world logistics problems
di: Ostermann, Birte, et al.
Pubblicazione: (2025)

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

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

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

Process-Based Lagrange Multipliers for Nonconvex Set-Valued Optimization
di: García-Castaño, Fernando, et al.
Pubblicazione: (2026)

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

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
di: Kanzow, Christian, et al.
Pubblicazione: (2025)

Multiobjective Programming and Weighting Scalar Problem
di: Ivanov, Vsevolod I.
Pubblicazione: (2025)

Second-order sequential optimality conditions for nonlinear semidefinite optimization problems
di: Li, Huimin, et al.
Pubblicazione: (2025)