Image de couverture de livre

Rank-sparsity decomposition for planted quasi clique recovery

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Abdulsalaam, Sakirudeen A., Ali, Montaz
Format:	Preprint
Publié:	2022
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

An ideal-sparse generalized moment problem reformulation for completely positive tensor decomposition exploiting maximal cliques of multi-hypergraphs
par: Huang, Pengfei, et autres
Publié: (2025)

Binary Kernel Logistic Regression: a sparsity-inducing formulation and a convergent decomposition training algorithm
par: Consolo, Antonio, et autres
Publié: (2025)

Accelerated projected gradient algorithms for sparsity constrained optimization problems
par: Alcantara, Jan Harold, et autres
Publié: (2022)

Support matrix machine: exploring sample sparsity, low rank, and adaptive sieving in high-performance computing
par: Wu, Can, et autres
Publié: (2024)

Chorded cycle facets of the clique partitioning polytope
par: Irmai, Jannik, et autres
Publié: (2024)

Finite convergence and minimizer extraction in moment relaxations with correlative sparsity
par: Fantuzzi, Giovanni, et autres
Publié: (2025)

On quasi-convex smooth optimization problems by a comparison oracle
par: Gasnikov, A. V., et autres
Publié: (2024)

Note about network decomposition by maximum flow
par: Lu, Tianhang
Publié: (2024)

Domain decomposition for entropic unbalanced optimal transport
par: Medina, Ismael, et autres
Publié: (2024)

A robust optimization approach to flow decomposition
par: Stinzendörfer, Moritz, et autres
Publié: (2024)

Moment-SOS relaxations for moment and tensor recovery problems
par: Huang, Lei, et autres
Publié: (2024)

Airline recovery problem under disruptions: A review
par: Wu, Shuai, et autres
Publié: (2024)

Solving convex QPs with structured sparsity under indicator conditions
par: Bienstock, Daniel, et autres
Publié: (2024)

Adaptive directional decomposition methods for nonconvex constrained optimization
par: Shi, Qiankun, et autres
Publié: (2025)

Lagrangian dual with zero duality gap that admits decomposition
par: Cifuentes, Diego, et autres
Publié: (2024)

Robust signal decompositions on the circle
par: Kose, Aral, et autres
Publié: (2025)

Efficient sparse probability measures recovery via Bregman gradient
par: Pan, Jianting, et autres
Publié: (2024)

Stabilized Benders decomposition for energy planning under climate uncertainty
par: Göke, Leonard, et autres
Publié: (2022)

Clustering-enhanced adaptive Benders decomposition for energy systems planning optimization
par: Law, Jun Wen, et autres
Publié: (2026)

A decomposition-based approach for large-scale pickup and delivery problems
par: Hiermann, G., et autres
Publié: (2024)

Sectoral and spatial decomposition methods for multi-sector capacity expansion models
par: Parolin, Federico, et autres
Publié: (2025)

Benders decomposition for the large-scale probabilistic set covering problem
par: Liang, Jie, et autres
Publié: (2025)

Learning to control inexact Benders decomposition via reinforcement learning
par: Li, Zhe, et autres
Publié: (2025)

A distributed augmented Lagrangian decomposition algorithm for constrained optimization
par: Guo, Wenyou, et autres
Publié: (2025)

Sharpness and well-conditioning of nonsmooth convex formulations in statistical signal recovery
par: Ding, Lijun, et autres
Publié: (2023)

Symmetric Rank-$k$ Methods
par: Liu, Chengchang, et autres
Publié: (2023)

Multi-Tubal Rank of Third Order Tensor and Related Low Rank Tensor Completion Problem
par: Yu, Quan, et autres
Publié: (2020)

Data-driven MPC with stability guarantees using extended dynamic mode decomposition
par: Bold, Lea, et autres
Publié: (2023)

Hyperspectral super-resolution via low rank tensor triple decomposition
par: Cui, Xiaofei, et autres
Publié: (2023)

Probabilistic analysis of dual decomposition on two-stage stochastic integer programs
par: Dey, Santanu S., et autres
Publié: (2026)

An Adaptive Cubic Regularization quasi-Newton Method on Riemannian Manifolds
par: Louzeiro, Mauricio S., et autres
Publié: (2024)

On Intensity of Preference Rank Reversal in the AHP
par: Mazurek, Jiri, et autres
Publié: (2025)

A decomposition algorithm for two-stage stochastic programs with approximate rotational invariance
par: Bakhshi, Marzieh, et autres
Publié: (2024)

Multistage stochastic optimization of a mono-site hydrogen infrastructure by decomposition techniques
par: Lefgoum, Raian, et autres
Publié: (2024)

Accelerating Benders decomposition for solving a sequence of sample average approximation replications
par: Kothari, Harshit, et autres
Publié: (2024)

Nonconvex quasi-variational inequalities: stability analysis and application to numerical optimization
par: Dutta, Joydeep, et autres
Publié: (2022)

A note on first order quasi-stationary Mean Field Games
par: Camilli, Fabio, et autres
Publié: (2024)

Convergence rates of regularized quasi-Newton methods without strong convexity
par: Wang, Shida, et autres
Publié: (2025)

Effective rates for continuous-time quasi-Fejér monotone dynamical systems
par: Freund, Anton, et autres
Publié: (2026)

Rank Estimation for Third-Order Tensor Completion in the Tensor-Train Format
par: Vermeylen, Charlotte, et autres
Publié: (2023)