Copertina

An over-relaxed ADMM for separable convex programming and its applications to statistical learning

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Ni, Renyuan
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the strength of Burer's lifted convex relaxation to quadratic programming with ball constraints
di: Kılınç-Karzan, Fatma, et al.
Pubblicazione: (2024)

ADMM for 0/1 D-Opt and MESP relaxations
di: Ponte, Gabriel, et al.
Pubblicazione: (2024)

An adaptive linearized alternating direction multiplier method with a relaxation step for convex programming
di: Wang, Boran
Pubblicazione: (2024)

Decentralized non-convex optimization via bi-level SQP and ADMM
di: Stomberg, Gösta, et al.
Pubblicazione: (2022)

Convergence for nonconvex ADMM, with applications to CT imaging
di: Barber, Rina Foygel, et al.
Pubblicazione: (2020)

On the supporting quasi-hyperplane and separation theorem of geodesic convex sets with applications on Riemannian manifolds
di: Zhou, Li-wen, et al.
Pubblicazione: (2024)

A relative-error inexact ADMM splitting algorithm for convex optimization with inertial effects
di: Alves, M. Marques, et al.
Pubblicazione: (2024)

A hierarchy of convex relaxations for the total variation distance
di: Lasserre, Jean-Bernard
Pubblicazione: (2024)

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

Non-convex Pose Graph Optimization in SLAM via Proximal Linearized Riemannian ADMM
di: Chen, Xin, et al.
Pubblicazione: (2024)

ADMM-Tracking Gradient for Distributed Optimization over Asynchronous and Unreliable Networks
di: Carnevale, Guido, et al.
Pubblicazione: (2023)

On the integrality gap of convex mixed-integer programs
di: Kocuk, Burak, et al.
Pubblicazione: (2024)

On semidefinite descriptions for convex hulls of quadratic programs
di: Wang, Alex L., et al.
Pubblicazione: (2024)

BC-ADMM: An Efficient Non-convex Constrained Optimizer with Robotic Applications
di: Pan, Zherong, et al.
Pubblicazione: (2025)

An accelerated semi-proximal ADMM with applications to multi-block sparse optimization problems
di: Liu, Peng, et al.
Pubblicazione: (2025)

Reinforcement learning for adaptive interior point methods in convex quadratic programming
di: Bertoncini, Jeremy, et al.
Pubblicazione: (2025)

First-order SDSOS-convex semi-algebraic optimization and exact SOCP relaxations
di: Yang, Chengmiao, et al.
Pubblicazione: (2025)

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

Numerical analysis of the convex relaxation of the barrier parameter functional of self-concordant barriers
di: Pirau, Vitali, et al.
Pubblicazione: (2025)

Hypodifferentials of nonsmooth convex functions and their applications to nonsmooth convex optimization
di: Dolgopolik, M. V.
Pubblicazione: (2023)

Dynamic programming and dimensionality in convex stochastic optimization and control
di: Pennanen, Teemu, et al.
Pubblicazione: (2025)

Solving separable convex optimization problems: Faster prediction-correction framework
di: Zhang, Tao, et al.
Pubblicazione: (2023)

On moment relaxations for linear state feedback controller synthesis with non-convex quadratic costs and constraints
di: Gramlich, Dennis, et al.
Pubblicazione: (2024)

Tightening convex relaxations of trained neural networks: a unified approach for convex and S-shaped activations
di: Carrasco, Pablo, et al.
Pubblicazione: (2024)

A Partition-Based Implementation of the Relaxed ADMM for Distributed Convex Optimization over Lossy Networks
di: Bastianello, Nicola, et al.
Pubblicazione: (2018)

Schrödinger bridge with transport relaxation
di: Jiang, Yifan, et al.
Pubblicazione: (2026)

Convex semi-infinite programming algorithms with inexact separation oracles
di: Oustry, Antoine, et al.
Pubblicazione: (2023)

Computing AD-compatible subgradients of convex relaxations of implicit functions
di: Song, Yingkai, et al.
Pubblicazione: (2025)

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

Sparse learning with concave regularization: relaxation of the irrepresentable condition
di: Cerone, V., et al.
Pubblicazione: (2025)

ALiA: Adaptive Linearized ADMM
di: Jang, Uijeong, et al.
Pubblicazione: (2026)

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

A twice continuously differentiable penalty function for nonlinear semidefinite programming problems and its application
di: Yamakawa, Yuya
Pubblicazione: (2025)

Decision Making under Costly Sequential Information Acquisition: the Paradigm of Reversible and Irreversible Decisions
di: Xu, Renyuan, et al.
Pubblicazione: (2023)

Distributed Optimization over Lossy Networks via Relaxed Peaceman-Rachford Splitting: a Robust ADMM Approach
di: Bastianello, Nicola, et al.
Pubblicazione: (2018)

A new separable property of the joint numerical range of quadratic functions and its applications to the Smallest Enclosing Ball Problem
di: Nguyen, Van-Bong, et al.
Pubblicazione: (2025)

On the tightness of linear relaxations of alternative mixed integer programming formulations for the generator maintenance scheduling problem
di: Andrade, Tiago
Pubblicazione: (2025)

On the (linear) convergence of Generalized Newton Inexact ADMM
di: Frangella, Zachary, et al.
Pubblicazione: (2023)

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)

A matrix-free interior point continuous trajectory for linearly constrained convex programming
di: Qian, Xun, et al.
Pubblicazione: (2024)