Imagen de Portada

The Maximum Singularity Degree for Linear and Semidefinite Programming

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Hu, Hao
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Semidefinite Programming Duality in Infinite-Horizon Linear Quadratic Differential Games
por: Watanabe, Yuto, et al.
Publicado: (2025)

Local Linear Convergence of the Alternating Direction Method of Multipliers for Semidefinite Programming under Strict Complementarity
por: Kang, Shucheng, et al.
Publicado: (2025)

Parametric Semidefinite Programming: Geometry of the Trajectory of Solutions
por: Bellon, Antonio, et al.
Publicado: (2021)

Affine FR: an Effective Facial Reduction Algorithm for Semidefinite Relaxations of Combinatorial Problems
por: Hu, Hao, et al.
Publicado: (2024)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
por: Proença, Nathan Benedetto, et al.
Publicado: (2026)

Dynamical State Feedback Control for Linear Input Delay Systems, Part I: Dissipative Stabilization via Semidefinite Programming
por: Feng, Qian, et al.
Publicado: (2023)

Noise Sensitivity of the Semidefinite Programs for Direct Data-Driven LQR
por: Zeng, Xiong, et al.
Publicado: (2024)

Sparse Sub-gaussian Random Projections for Semidefinite Programming Relaxations
por: Guedes-Ayala, Monse, et al.
Publicado: (2024)

A Low-Rank ADMM Splitting Approach for Semidefinite Programming
por: Han, Qiushi, et al.
Publicado: (2024)

Lagrangian Duality for Mixed-Integer Semidefinite Programming: Theory and Algorithms
por: de Meijer, Frank, et al.
Publicado: (2025)

Complexity of Chordal Conversion for Sparse Semidefinite Programs with Small Treewidth
por: Zhang, Richard Y.
Publicado: (2023)

An Overview and Comparison of Spectral Bundle Methods for Primal and Dual Semidefinite Programs
por: Liao, Feng-Yi, et al.
Publicado: (2023)

Accelerating Low-Rank Factorization-Based Semidefinite Programming Algorithms on GPU
por: Han, Qiushi, et al.
Publicado: (2024)

Spanning and Splitting: Integer Semidefinite Programming for the Quadratic Minimum Spanning Tree Problem
por: de Meijer, Frank, et al.
Publicado: (2024)

New Understandings and Computation on Augmented Lagrangian Methods for Low-Rank Semidefinite Programming
por: Ding, Lijun, et al.
Publicado: (2025)

Heuristic Bundle Upper Bound Based Polyhedral Bundle Method for Semidefinite Programming
por: Cui, Zilong, et al.
Publicado: (2025)

An Inexact Tensor-Train Primal-Dual Interior-Point Method for Semidefinite Programs
por: Kelbel, Frederik, et al.
Publicado: (2025)

Post-Processing with Projection and Rescaling Algorithms for Semidefinite Programming
por: Kanoh, Shin-ichi, et al.
Publicado: (2024)

Quantum Alternating Direction Method of Multipliers for Semidefinite Programming
por: Nie, Hantao, et al.
Publicado: (2025)

A Tuning-Free Primal-Dual Splitting Algorithm for Large-Scale Semidefinite Programming
por: Wang, Yinjun, et al.
Publicado: (2024)

Local Second-Order Limit Dynamics of the Alternating Direction Method of Multipliers for Semidefinite Programming
por: Kang, Shucheng, et al.
Publicado: (2026)

A New Semidefinite Relaxation for Linear and Piecewise-Affine Optimal Control with Time Scaling
por: Yang, Lujie, et al.
Publicado: (2025)

Well-conditioned Primal-Dual Interior-point Method for Accurate Low-rank Semidefinite Programming
por: Chiu, Hong-Ming, et al.
Publicado: (2024)

Towards Scalable Semidefinite Programming: Optimal Metric ADMM with A Worst-case Performance Guarantee
por: Ran, Yifan, et al.
Publicado: (2024)

A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering
por: Sudoso, Antonio M.
Publicado: (2024)

Centering ADMM for the Semidefinite Relaxation of the QAP
por: Kanoh, Shin-ichi, et al.
Publicado: (2020)

Sparse Cuts for the Positive Semidefinite Cone
por: Günlük, Oktay, et al.
Publicado: (2026)

Mixtures Closest to a Given Measure: A Semidefinite Programming Approach
por: Đurašinović, Srećko, et al.
Publicado: (2025)

Fast, Scalable, Warm-Start Semidefinite Programming with Spectral Bundling and Sketching
por: Angell, Rico, et al.
Publicado: (2023)

Towards Optimal Branching of Linear and Semidefinite Relaxations for Neural Network Robustness Certification
por: Anderson, Brendon G., et al.
Publicado: (2021)

Postive Semidefinite and Sum of Squares Biquadratic Polynomials
por: Cui, Chunfeng, et al.
Publicado: (2025)

On Squared-Variable Formulations for Nonlinear Semidefinite programming
por: Ding, Lijun, et al.
Publicado: (2025)

Exactness Conditions for Semidefinite Relaxations of the Quadratic Assignment Problem
por: Chen, Junyu, et al.
Publicado: (2024)

Statistically Optimal K-means Clustering via Nonnegative Low-rank Semidefinite Programming
por: Zhuang, Yubo, et al.
Publicado: (2023)

A Cutting-plane Method for Semidefinite Programming with Potential Applications on Noisy Quantum Devices
por: Marecek, Jakub, et al.
Publicado: (2021)

Accelerating a Linear Programming Algorithm on AMD GPUs
por: Hu, Xiyan, et al.
Publicado: (2025)

Semidefinite Relaxations of the Gromov-Wasserstein Distance
por: Chen, Junyu, et al.
Publicado: (2023)

Multi-Criteria Inverse Robustness in Radiotherapy Planning Using Semidefinite Programming
por: Schröeder, Jan, et al.
Publicado: (2026)

Finding Maximum Determinant Principal Submatrices via Hadamard Bounds and Projection Methods
por: Hu, Hao, et al.
Publicado: (2025)

Semidefinite relaxations for nonlinear elasticity with energies convex in the Cauchy-Green strain tensor
por: Henrion, Didier, et al.
Publicado: (2026)