Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kostyukova, O. I., Tchemisova, T. V.
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control 90C25, 15B48, 05C50, 05C69
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Refined Estimates on the Dimensions of Maximal Faces of Completely Positive Cones
par: Kostyukova, O. I., et autres
Publié: (2026)

Complexity of Geometric programming in the Turing model and application to nonnegative tensors
par: Friedland, Shmuel, et autres
Publié: (2023)

Cliques and independent subgroups of the Birkhoff polytope graph
par: Huang, Zejun, et autres
Publié: (2022)

On Circuit Imbalance and 0/1 Circuits for Coloring and Spanning Forest Problems
par: Borgwardt, Steffen, et autres
Publié: (2025)

Multi-objective stochastic linear programming with recourse and flexible decision making
par: Hamel, Andreas H., et autres
Publié: (2024)

Copositive Matrices with Ordered Off-Diagonal Entries
par: Blekherman, Grigoriy, et autres
Publié: (2026)

From semi-total to equitable total colorings
par: Dejter, I. J.
Publié: (2025)

On generalized KKT points for the Motzkin-Straus program
par: Beretta, G., et autres
Publié: (2023)

Properties of the complementarity set for the cone of copositive matrices
par: Kostyukova, O. I.
Publié: (2024)

On Almost-Type Special Structured Tensor Classes Associated with Semi-Positive Tensors
par: Chauhan, Bharat Pratap, et autres
Publié: (2024)

Improved Bounds for the Ultimate Independence Ratio of Odd Wheels
par: Clow, Alexander, et autres
Publié: (2025)

Copositive and completely positive cones over symmetric cones of rank at least 5
par: Nishijima, Mitsuhiro
Publié: (2026)

Achieving $\tilde{\mathcal{O}}(1/N)$ Optimality Gap in Restless Bandits through Gaussian Approximation
par: Yan, Chen, et autres
Publié: (2024)

Efficient vectors in priority setting methodology
par: Furtado, Susana, et autres
Publié: (2023)

Strict Copositivity for a Class of 3rd Order Symmetric Tensors
par: Li, Min, et autres
Publié: (2024)

A Regression-Based Prediction-Correction Method for Stochastic Time-Varying Optimization Problems
par: Kamijima, Tomoya, et autres
Publié: (2025)

Stochastic Block Bregman Projection with Polyak-like Stepsize for Possibly Inconsistent Convex Feasibility Problems
par: Zhang, Lu, et autres
Publié: (2026)

Copositivity criteria of a class of fourth order 3-dimensional symmetric tensors
par: Song, Yisheng, et autres
Publié: (2023)

Solving exact and noisy rank-one tensor completion with semidefinite programming
par: Cifuentes, Diego, et autres
Publié: (2025)

A simulation-optimization approach for fractional, profitability-oriented inventory control under service-level type constraints
par: Sun, Tianxiao, et autres
Publié: (2026)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
par: Traoré, Cheik, et autres
Publié: (2025)

A Newton Augmented Lagrangian Method for Symmetric Cone Programming with Complexity Analysis
par: Zhang, Rui-Jin, et autres
Publié: (2025)

Total Conformal Rigidity in Graphs
par: Assumpção, Henrique, et autres
Publié: (2026)

Splitting Algorithms for Distributionally Robust Optimization
par: Briceño-Arias, Luis, et autres
Publié: (2024)

The $k$-core of a graph and its high-order spectra
par: Liu, Chunmeng, et autres
Publié: (2025)

A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
par: Yang, Lei, et autres
Publié: (2023)

Single Element Error Correction/ in a Euclidean Distance Matrix
par: Alfakih, Abdo, et autres
Publié: (2024)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
par: He, Jiahuan, et autres
Publié: (2023)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
par: Song, Yongcun, et autres
Publié: (2024)

Strengthening Wilf's lower bound on clique number
par: Jadav, Hareshkumar, et autres
Publié: (2025)

Inertia, Independence and Expanders
par: Tang, Quanyu, et autres
Publié: (2025)

On a Generalization of Wasserstein Distance and the Beckmann Problem to Connection Graphs
par: Robertson, Sawyer, et autres
Publié: (2023)

Algebraic Farkas Lemma and Strong Duality for Perturbed Conic Linear Programming
par: Khanh, P. D., et autres
Publié: (2026)

Max-Min Bilinear Completely Positive Programs: A Semidefinite Relaxation with Tightness Guarantees
par: Gao, Sarah Yini, et autres
Publié: (2026)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
par: Hou, Di, et autres
Publié: (2023)

Linear Convergence and Error Bounds for Optimization Without Strong Convexity
par: van Treek, Kira, et autres
Publié: (2025)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
par: Chen, Kaihuang, et autres
Publié: (2025)

Duality of Hoffman constants
par: Pena, Javier F., et autres
Publié: (2023)

Application of the Lovász-Schrijver Lift-and-Project Operator to Compact Stable Set Integer Programs
par: Battista, Federico, et autres
Publié: (2024)

Bounding Clique Size in Squares of Planar Graphs
par: Cranston, Daniel W.
Publié: (2023)