Cover Image

Copositive Matrices with Ordered Off-Diagonal Entries

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Blekherman, Grigoriy, Dey, Santanu S., Dunbar, Alex, Kocuk, Burak
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control 90C20, 90C22, 15B48
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Copositive and completely positive cones over symmetric cones of rank at least 5
by: Nishijima, Mitsuhiro
Published: (2026)

Representation of Zeros of a Copositive Matrix via Maximal Cliques of a Graph
by: Kostyukova, O. I., et al.
Published: (2024)

On odd powers of nonnegative polynomials that are not sums of squares
by: Blekherman, Grigoriy, et al.
Published: (2024)

A semidefinite programming hierarchy for covering problems in discrete geometry
by: Riener, Cordian, et al.
Published: (2023)

Max-Min Bilinear Completely Positive Programs: A Semidefinite Relaxation with Tightness Guarantees
by: Gao, Sarah Yini, et al.
Published: (2026)

On the longest chain of faces of the completely positive and copositive cones
by: Nishijima, Mitsuhiro
Published: (2023)

Convergence Rate of a Functional Learning Method for Contextual Stochastic Optimization
by: Smith, Noel, et al.
Published: (2026)

Refined Estimates on the Dimensions of Maximal Faces of Completely Positive Cones
by: Kostyukova, O. I., et al.
Published: (2026)

Subdifferentials of Convex Operators Valued in the Space of Integrable Functions with Application to Risk-Averse Optimization
by: Dentcheva, Darinka, et al.
Published: (2025)

$K-$Lorentzian Polynomials, Semipositive Cones, and Cone-Stable EVI Systems
by: Dey, Papri
Published: (2025)

Solving Sparsity Constrained PCA, Regression, and QCQP via the Spartrahedron
by: Cifuentes, Diego, et al.
Published: (2026)

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

Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
by: Bomze, Immanuel, et al.
Published: (2024)

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

A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
by: Hou, Di, et al.
Published: (2025)

Primal and Dual Characterizations for Farkas type Lemmas in Terms of Closedness Criteria
by: Dinh, Nguyen, et al.
Published: (2025)

Quasi-Newton methods for minimizing a quadratic function subject to uncertainty
by: Peng, Shen, et al.
Published: (2021)

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

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

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

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

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

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

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

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

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

Single Element Error Correction/ in a Euclidean Distance Matrix
by: Alfakih, Abdo, et al.
Published: (2024)

Copositivity criteria of a class of fourth order 3-dimensional symmetric tensors
by: Song, Yisheng, et al.
Published: (2023)

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)

Exponential Conic Optimization for Multi-Regime Service System Design under Congestion and Tail-Risk Control
by: Blanco, Víctor, et al.
Published: (2026)

On Almost-Type Special Structured Tensor Classes Associated with Semi-Positive Tensors
by: Chauhan, Bharat Pratap, et al.
Published: (2024)

The uniqueness of Lyapunov rank among symmetric cones
by: Orlitzky, Michael, et al.
Published: (2025)

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

A Riemannian Accelerated Proximal Gradient Method
by: Feng, Shuailing, et al.
Published: (2025)

A Dual Riemannian ADMM Algorithm for Low-Rank SDPs with Unit Diagonal
by: Wang, Jie, et al.
Published: (2025)

A Newton Augmented Lagrangian Method for Symmetric Cone Programming with Complexity Analysis
by: Zhang, Rui-Jin, et al.
Published: (2025)

Riemannian Federated Learning via Averaging Gradient Streams
by: Huang, Zhenwei, et al.
Published: (2024)

Solving exact and noisy rank-one tensor completion with semidefinite programming
by: Cifuentes, Diego, et al.
Published: (2025)

A semi-smooth Newton method for general projection equations applied to the nearest correlation matrix problem
by: Armijo, Nicolas F., et al.
Published: (2024)