Cover Image

Rank-sparsity decomposition for planted quasi clique recovery

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abdulsalaam, Sakirudeen A., Ali, Montaz
Format:	Preprint
Published:	2022
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An ideal-sparse generalized moment problem reformulation for completely positive tensor decomposition exploiting maximal cliques of multi-hypergraphs
by: Huang, Pengfei, et al.
Published: (2025)

Binary Kernel Logistic Regression: a sparsity-inducing formulation and a convergent decomposition training algorithm
by: Consolo, Antonio, et al.
Published: (2025)

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

Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing
by: Wu, Can, et al.
Published: (2024)

Chorded cycle facets of the clique partitioning polytope
by: Irmai, Jannik, et al.
Published: (2024)

Finite convergence and minimizer extraction in moment relaxations with correlative sparsity
by: Fantuzzi, Giovanni, et al.
Published: (2025)

On quasi-convex smooth optimization problems by a comparison oracle
by: Gasnikov, A. V., et al.
Published: (2024)

Note about network decomposition by maximum flow
by: Lu, Tianhang
Published: (2024)

Domain decomposition for entropic unbalanced optimal transport
by: Medina, Ismael, et al.
Published: (2024)

A robust optimization approach to flow decomposition
by: Stinzendörfer, Moritz, et al.
Published: (2024)

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

Airline recovery problem under disruptions: A review
by: Wu, Shuai, et al.
Published: (2024)

Solving convex QPs with structured sparsity under indicator conditions
by: Bienstock, Daniel, et al.
Published: (2024)

Adaptive directional decomposition methods for nonconvex constrained optimization
by: Shi, Qiankun, et al.
Published: (2025)

Lagrangian dual with zero duality gap that admits decomposition
by: Cifuentes, Diego, et al.
Published: (2024)

Robust signal decompositions on the circle
by: Kose, Aral, et al.
Published: (2025)

Efficient sparse probability measures recovery via Bregman gradient
by: Pan, Jianting, et al.
Published: (2024)

Stabilized Benders decomposition for energy planning under climate uncertainty
by: Göke, Leonard, et al.
Published: (2022)

Clustering-enhanced adaptive Benders decomposition for energy systems planning optimization
by: Law, Jun Wen, et al.
Published: (2026)

A decomposition-based approach for large-scale pickup and delivery problems
by: Hiermann, G., et al.
Published: (2024)

Sectoral and spatial decomposition methods for multi-sector capacity expansion models
by: Parolin, Federico, et al.
Published: (2025)

Benders decomposition for the large-scale probabilistic set covering problem
by: Liang, Jie, et al.
Published: (2025)

Learning to control inexact Benders decomposition via reinforcement learning
by: Li, Zhe, et al.
Published: (2025)

A distributed augmented Lagrangian decomposition algorithm for constrained optimization
by: Guo, Wenyou, et al.
Published: (2025)

Sharpness and well-conditioning of nonsmooth convex formulations in statistical signal recovery
by: Ding, Lijun, et al.
Published: (2023)

Symmetric Rank-$k$ Methods
by: Liu, Chengchang, et al.
Published: (2023)

Multi-Tubal Rank of Third Order Tensor and Related Low Rank Tensor Completion Problem
by: Yu, Quan, et al.
Published: (2020)

Data-driven MPC with stability guarantees using extended dynamic mode decomposition
by: Bold, Lea, et al.
Published: (2023)

Hyperspectral super-resolution via low rank tensor triple decomposition
by: Cui, Xiaofei, et al.
Published: (2023)

Probabilistic analysis of dual decomposition on two-stage stochastic integer programs
by: Dey, Santanu S., et al.
Published: (2026)

An Adaptive Cubic Regularization quasi-Newton Method on Riemannian Manifolds
by: Louzeiro, Mauricio S., et al.
Published: (2024)

On Intensity of Preference Rank Reversal in the AHP
by: Mazurek, Jiri, et al.
Published: (2025)

A decomposition algorithm for two-stage stochastic programs with approximate rotational invariance
by: Bakhshi, Marzieh, et al.
Published: (2024)

Multistage stochastic optimization of a mono-site hydrogen infrastructure by decomposition techniques
by: Lefgoum, Raian, et al.
Published: (2024)

Accelerating Benders decomposition for solving a sequence of sample average approximation replications
by: Kothari, Harshit, et al.
Published: (2024)

Nonconvex quasi-variational inequalities: stability analysis and application to numerical optimization
by: Dutta, Joydeep, et al.
Published: (2022)

A note on first order quasi-stationary Mean Field Games
by: Camilli, Fabio, et al.
Published: (2024)

Convergence rates of regularized quasi-Newton methods without strong convexity
by: Wang, Shida, et al.
Published: (2025)

Effective rates for continuous-time quasi-Fejér monotone dynamical systems
by: Freund, Anton, et al.
Published: (2026)

Rank Estimation for Third-Order Tensor Completion in the Tensor-Train Format
by: Vermeylen, Charlotte, et al.
Published: (2023)