Copertina

Tight SDP relaxations for cardinality-constrained problems

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Wiegele, Angelika, Zhao, Shudian
Natura:	Preprint
Pubblicazione:	2021
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Strong SDP based bounds on the cutwidth of a graph
di: Gaar, Elisabeth, et al.
Pubblicazione: (2023)

Edge expansion of a graph: SDP-based computational strategies
di: Gupte, Akshay, et al.
Pubblicazione: (2024)

A constrained optimization approach to improve robustness of neural networks
di: Zhao, Shudian, et al.
Pubblicazione: (2024)

Connectivity via convexity: Bounds on the edge expansion in graphs
di: Hrga, Timotej, et al.
Pubblicazione: (2024)

Tight semidefinite programming relaxations for sparse box-constrained quadratic programs
di: Khajavirad, Aida
Pubblicazione: (2026)

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

A Tight SDP Relaxation for the Cubic-Quartic Regularization Problem
di: Zhou, Jinling, et al.
Pubblicazione: (2025)

Tightness of SDP and Burer-Monteiro Factorization for Phase Synchronization in High-Noise Regime
di: Zhang, Anderson Ye
Pubblicazione: (2025)

Fast entropy-regularized SDP relaxations for permutation synchronization
di: Lindsey, Michael, et al.
Pubblicazione: (2025)

On exactness of SDP relaxation for the maximum cut problem
di: Bhardwaj, Avinash, et al.
Pubblicazione: (2025)

Extended-variable relaxations for the constrained generalized maximum-entropy sampling problem
di: Ponte, Gabriel, et al.
Pubblicazione: (2026)

Box-constrained L0 Bregman-relaxations
di: Essafri, Mhamed, et al.
Pubblicazione: (2025)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
di: Brosch, Daniel, et al.
Pubblicazione: (2025)

A scalable mixed-integer conic optimization approach to cardinality-constrained Poisson regression with safe screening
di: Kurihara, Kota, et al.
Pubblicazione: (2025)

A relaxation method for binary optimizations on constrained Stiefel manifold
di: Xiao, Lianghai, et al.
Pubblicazione: (2023)

Approximating Dispatchable Regions in Three-Phase Radial Networks with Conditions for Exact SDP Relaxation
di: Fang, Bohang, et al.
Pubblicazione: (2025)

Connecting Max-entropy With Computational Geometry, LP And SDP
di: Lasserre, Jean B
Pubblicazione: (2026)

Set-based state estimation of nonlinear discrete-time systems using constrained zonotopes and polyhedral relaxations
di: Rego, Brenner S., et al.
Pubblicazione: (2025)

The sum of root-leaf distance interdiction problem with cardinality constraint by upgrading edges on trees
di: Li, Xiao, et al.
Pubblicazione: (2023)

On the SDP Relaxation of Direct Torque Finite Control Set Model Predictive Control
di: Hartmann, Luca M., et al.
Pubblicazione: (2024)

Mirror descent for constrained stochastic control problems
di: Sethi, Deven, et al.
Pubblicazione: (2025)

Instance-specific linear relaxations of semidefinite optimization problems
di: de Roux, Daniel, et al.
Pubblicazione: (2023)

Moment-SOS relaxations for moment and tensor recovery problems
di: Huang, Lei, et al.
Pubblicazione: (2024)

Calm local optimality for couple-constrained minimax problems
di: Ma, Xiaoxiao, et al.
Pubblicazione: (2025)

Solving quadratic binary optimization problems using quantum SDP methods: Non-asymptotic running time analysis
di: Henze, Fabian, et al.
Pubblicazione: (2025)

SDP bounds on quantum codes
di: Munné, Gerard Anglès, et al.
Pubblicazione: (2024)

A Scalable Bundle Method for Exact Reformulation of SDP in Three-Phase Power Flow Feasibility
di: Fang, Bohang, et al.
Pubblicazione: (2026)

A more efficient reformulation of complex SDP as real SDP
di: Wang, Jie
Pubblicazione: (2023)

TinySDP: Real Time Semidefinite Optimization for Certifiable and Agile Edge Robotics
di: Mahajan, Ishaan, et al.
Pubblicazione: (2026)

An SDP Relaxation for the Sparse Integer Least Squares Problem
di: Del Pia, Alberto, et al.
Pubblicazione: (2022)

Provable Exactness for Asymmetric Low-Rank SDP Learning
di: Hu, Enliang
Pubblicazione: (2018)

Chordal Sparsity for SDP-based Neural Network Verification
di: Xue, Anton, et al.
Pubblicazione: (2022)

A relax-fix-and-exclude algorithm for an MINLP problem with multilinear interpolations
di: Pacheco, Bruno Machado, et al.
Pubblicazione: (2025)

Accelerated projected gradient algorithms for sparsity constrained optimization problems
di: Alcantara, Jan Harold, et al.
Pubblicazione: (2022)

Alternating Direction Method of Multipliers for nonlinear constrained convex problems and applications to distributed resource allocation and constrained machine learning
di: Xiong, Zhengjie, et al.
Pubblicazione: (2026)

Chance-constrained battery management strategies for the electric bus scheduling problem
di: Ricard, Léa, et al.
Pubblicazione: (2025)

RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs
di: Hou, Di, et al.
Pubblicazione: (2025)

On the risk levels of distributionally robust chance constrained problems
di: Heinlein, Moritz, et al.
Pubblicazione: (2024)

An extended Merton problem with relaxed benchmark tracking
di: Bo, Lijun, et al.
Pubblicazione: (2023)

Parabolic optimal control problems with combinatorial switching constraints -- Part I: Convex relaxations
di: Buchheim, Christoph, et al.
Pubblicazione: (2022)