Cover Image

Representation of Zeros of a Copositive Matrix via Maximal Cliques of a Graph

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kostyukova, O. I., Tchemisova, T. V.
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C25, 15B48, 05C50, 05C69
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Complexity of Geometric programming in the Turing model and application to nonnegative tensors
by: Friedland, Shmuel, et al.
Published: (2023)

Cliques and independent subgroups of the Birkhoff polytope graph
by: Huang, Zejun, et al.
Published: (2022)

On Circuit Imbalance and 0/1 Circuits for Coloring and Spanning Forest Problems
by: Borgwardt, Steffen, et al.
Published: (2025)

Multi-objective stochastic linear programming with recourse and flexible decision making
by: Hamel, Andreas H., et al.
Published: (2024)

Copositive Matrices with Ordered Off-Diagonal Entries
by: Blekherman, Grigoriy, et al.
Published: (2026)

From semi-total to equitable total colorings
by: Dejter, I. J.
Published: (2025)

On generalized KKT points for the Motzkin-Straus program
by: Beretta, G., et al.
Published: (2023)

Properties of the complementarity set for the cone of copositive matrices
by: Kostyukova, O. I.
Published: (2024)

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

Improved Bounds for the Ultimate Independence Ratio of Odd Wheels
by: Clow, Alexander, et al.
Published: (2025)

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

Achieving $\tilde{\mathcal{O}}(1/N)$ Optimality Gap in Restless Bandits through Gaussian Approximation
by: Yan, Chen, et al.
Published: (2024)

Efficient vectors in priority setting methodology
by: Furtado, Susana, et al.
Published: (2023)

Strict Copositivity for a Class of 3rd Order Symmetric Tensors
by: Li, Min, et al.
Published: (2024)

A Regression-Based Prediction-Correction Method for Stochastic Time-Varying Optimization Problems
by: Kamijima, Tomoya, et al.
Published: (2025)

Stochastic Block Bregman Projection with Polyak-like Stepsize for Possibly Inconsistent Convex Feasibility Problems
by: Zhang, Lu, et al.
Published: (2026)

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

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

A simulation-optimization approach for fractional, profitability-oriented inventory control under service-level type constraints
by: Sun, Tianxiao, et al.
Published: (2026)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
by: Traoré, Cheik, et al.
Published: (2025)

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

Total Conformal Rigidity in Graphs
by: Assumpção, Henrique, et al.
Published: (2026)

Splitting Algorithms for Distributionally Robust Optimization
by: Briceño-Arias, Luis, et al.
Published: (2024)

The $k$-core of a graph and its high-order spectra
by: Liu, Chunmeng, et al.
Published: (2025)

A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
by: Yang, Lei, et al.
Published: (2023)

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

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
by: He, Jiahuan, et al.
Published: (2023)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
by: Song, Yongcun, et al.
Published: (2024)

Strengthening Wilf's lower bound on clique number
by: Jadav, Hareshkumar, et al.
Published: (2025)

Inertia, Independence and Expanders
by: Tang, Quanyu, et al.
Published: (2025)

On a Generalization of Wasserstein Distance and the Beckmann Problem to Connection Graphs
by: Robertson, Sawyer, et al.
Published: (2023)

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

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

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
by: Hou, Di, et al.
Published: (2023)

Linear Convergence and Error Bounds for Optimization Without Strong Convexity
by: van Treek, Kira, et al.
Published: (2025)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
by: Chen, Kaihuang, et al.
Published: (2025)

Duality of Hoffman constants
by: Pena, Javier F., et al.
Published: (2023)

Application of the Lovász-Schrijver Lift-and-Project Operator to Compact Stable Set Integer Programs
by: Battista, Federico, et al.
Published: (2024)

Bounding Clique Size in Squares of Planar Graphs
by: Cranston, Daniel W.
Published: (2023)