Copertina

Error Bounds for Rank-one Double Nonnegative Reformulations of QAP and Exact Penalties

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Qian, Yitian, Pan, Shaohua, Bi, Shujun, Qi, Houduo
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control 90C27, 90C26, 49M20
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

GLL-type Nonmonotone Descent Methods Revisited under Kurdyka-Łojasiewicz Property
di: Qian, Yitian, et al.
Pubblicazione: (2025)

Convergence of ZH-type nonmonotone descent method for Kurdyka-Łojasiewicz optimization problems
di: Qian, Yitian, et al.
Pubblicazione: (2024)

Convergence of the majorized PAM method with subspace correction for low-rank composite factorization model
di: Tao, Ting, et al.
Pubblicazione: (2024)

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

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)

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
di: Jung, Woosuk L., et al.
Pubblicazione: (2023)

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

Optimality conditions via exact penalty functions
di: Ivanov, Vsevolod Ivanov
Pubblicazione: (2026)

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

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

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

Switching Point Optimization for Abstract Parabolic Equations
di: Buchheim, Christoph, et al.
Pubblicazione: (2026)

Sublinear Scalarizations for Proper and Approximate Proper Efficient Points in Nonconvex Vector Optimization
di: García-Castaño, Fernando, et al.
Pubblicazione: (2024)

Nonlinear Separation Theorems for Co-Radiant Sets and Optimality Conditions for Approximate and Proper Approximate Solutions in Vector Optimization
di: García-Castaño, Fernando, et al.
Pubblicazione: (2025)

A full splitting algorithm for fractional programs with structured numerators and denominators
di: Boţ, Radu Ioan, et al.
Pubblicazione: (2023)

A Single-loop Proximal Subgradient Algorithm for A Class Structured Fractional Programs
di: Han, Deren, et al.
Pubblicazione: (2025)

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

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

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

McCormick envelopes in mixed-integer PDE-constrained optimization
di: Leyffer, Sven, et al.
Pubblicazione: (2024)

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
di: Kabgani, Alireza, et al.
Pubblicazione: (2025)

Flexible block-iterative analysis for the Frank-Wolfe algorithm
di: Braun, Gábor, et al.
Pubblicazione: (2024)

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

Composite Optimization with Indicator Functions: Stationary Duality and a Semismooth Newton Method
di: Zhang, Penghe, et al.
Pubblicazione: (2025)

Level Constrained First Order Methods for Function Constrained Optimization
di: Boob, Digvijay, et al.
Pubblicazione: (2022)

Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
di: Prakhya, Karthik, et al.
Pubblicazione: (2026)

On Error Bounds for Rank-Constrained Affine Matrix Sets
di: Chen, Ruoning, et al.
Pubblicazione: (2025)

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

Approximation Analysis of the Entropic Penalty in Quadratic Programming
di: Karumanchi, Venkatkrishna, et al.
Pubblicazione: (2025)

Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation
di: Bai, Xiaoning, et al.
Pubblicazione: (2024)

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

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

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

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

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

On Differential Stability of a Class of Convex Optimization Problems
di: Yen, Nguyen Dong, et al.
Pubblicazione: (2024)

Revisiting the Geometrically Decaying Step Size: Linear Convergence for Smooth or Non-Smooth Functions
di: Kim, Jihun
Pubblicazione: (2025)

Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
di: Latafat, Puya, et al.
Pubblicazione: (2021)

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
di: Themelis, Andreas, et al.
Pubblicazione: (2020)

On the existence and the stability of solutions in nonconvex vector optimization
di: Van Nghi, Tran, et al.
Pubblicazione: (2025)