Copertina

De-singularity Subgradient for the $q$-th-Powered $\ell_p$-Norm Weber Location Problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Lai, Zhao-Rong, Wu, Xiaotian, Fang, Liangda, Chen, Ziliang, Li, Cheng
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A De-singularity Subgradient Approach for the Extended Weber Location Problem
di: Lai, Zhao-Rong, et al.
Pubblicazione: (2024)

Sparse Recovery via $\ell_p^p/\ell_q^p$ Ratio Minimization: Theory and Algorithm
di: Yu, Lang, et al.
Pubblicazione: (2026)

$\ell_p$-sphere covering and approximating nuclear $p$-norm
di: Guan, Jiewen, et al.
Pubblicazione: (2023)

PowerStep: Memory-Efficient Adaptive Optimization via $\ell_p$-Norm Steepest Descent
di: Lu, Yao, et al.
Pubblicazione: (2026)

Beyond First-Order Methods for $\ell_p$-Structured Non-Monotone Variational Inequalities
di: Vyas, Abhijeet, et al.
Pubblicazione: (2026)

Towards An Efficient Approach for the Nonconvex $\ell_p$ Ball Projection: Algorithm and Analysis
di: Yang, Xiangyu, et al.
Pubblicazione: (2021)

Iterative Refinement for $\ell_p$-norm Regression
di: Adil, Deeksha, et al.
Pubblicazione: (2019)

Bearing-Only Solution for Fermat-Weber Location Problem: Generalized Algorithms
di: Le-Phan, Nhat-Minh, et al.
Pubblicazione: (2024)

Convergence Rates for $\ell_p$ Norm Minimization in Convex Vector Optimization
di: Alshahrani, Mohammed
Pubblicazione: (2026)

Sparse Recovery: The Square of $\ell_1/\ell_2$ Norms
di: Jia, Jianqing, et al.
Pubblicazione: (2024)

Federated Incremental Subgradient Method for Convex Bilevel Optimization Problems
di: Boontawee, Sudkobfa, et al.
Pubblicazione: (2026)

Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems
di: Ding, Kuangyu, et al.
Pubblicazione: (2024)

Fixed-Point Delayed Subgradient Methods for Nonsmooth Convex Optimization Problems
di: Pankoon, Ontima, et al.
Pubblicazione: (2026)

Revisiting Continuous p-Hub Location Problems with the L1 Metric
di: Wu, Yifan, et al.
Pubblicazione: (2025)

Subgradient sampling for nonsmooth nonconvex minimization
di: Bolte, Jérôme, et al.
Pubblicazione: (2022)

Revisiting $L_q(0\leq q<1)$ Norm Regularized Optimization
di: Zhou, Shenglong, et al.
Pubblicazione: (2023)

An Efficient Stochastic Subgradient Method for the Global Placement Problem in Very Large-Scale Integration Circuits
di: Yue, Yi-Shuang, et al.
Pubblicazione: (2024)

Subgradient Gliding Method for Nonsmooth Convex Optimization
di: Zhu, Zhihan, et al.
Pubblicazione: (2026)

Day-Ahead Offering for Virtual Power Plants: A Stochastic Linear Programming Reformulation and Projected Subgradient Method
di: Meng, Weiqi, et al.
Pubblicazione: (2026)

Subgradient Methods for Nonsmooth Convex Functions with Adversarial Errors
di: Gösgens, Martijn, et al.
Pubblicazione: (2025)

Policy Optimization in Robust Control: Weak Convexity and Subgradient Methods
di: Watanabe, Yuto, et al.
Pubblicazione: (2025)

A Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization
di: Xiao, Nachuan, et al.
Pubblicazione: (2025)

Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity
di: Li, Xiao, et al.
Pubblicazione: (2023)

Subgradient Splitting Methods for Nonsmooth Fractional Programming with Fixed-Point Constraints
di: Prangprakhon, Mootta, et al.
Pubblicazione: (2025)

A Stochastic Conjugate Subgradient Algorithm for Two-stage Stochastic Programming
di: Zhang, Di, et al.
Pubblicazione: (2025)

Revisiting Subgradient Dominance in Robust MDPs: Counterexamples, Hardness, and Sufficient Conditions
di: Kitamura, Toshinori, et al.
Pubblicazione: (2026)

Extrapolated Hard Thresholding Algorithms with Finite Length for Composite $\ell_0$ Penalized Problems
di: Wu, Fan, et al.
Pubblicazione: (2025)

Implicit Bias of AdamW: $\ell_\infty$ Norm Constrained Optimization
di: Xie, Shuo, et al.
Pubblicazione: (2024)

An Axiomatic Analysis of Distributionally Robust Optimization with $q$-Norm Ambiguity Sets for Probability Smoothing
di: Izunaga, Yoichi, et al.
Pubblicazione: (2025)

Approximating $q \rightarrow p$ Norms of Non-Negative Matrices in Nearly-Linear Time
di: Objois, Étienne, et al.
Pubblicazione: (2025)

On the Complexity of Finding Small Subgradients in Nonsmooth Optimization
di: Kornowski, Guy, et al.
Pubblicazione: (2022)

Convergence analysis of linearized $\ell_q$ penalty methods for nonconvex optimization with nonlinear equality constraints
di: Bourkhissi, Lahcen El, et al.
Pubblicazione: (2025)

Solving Convex-Concave Problems with $\tilde{\mathcal{O}}(ε^{-4/(3p+1)})$ $p$th-Order Oracle Complexity
di: Chen, Lesi, et al.
Pubblicazione: (2026)

Moreau Envelope-Based Clustering for Generalized Multi-Source Weber Problem
di: Van, Nguyen Thi Thu
Pubblicazione: (2026)

Orientation Determination of Cryo-EM Images Using Block Stochastic Riemannian Subgradient Methods
di: Zhang, Wanyu, et al.
Pubblicazione: (2024)

Untangling Lariats: Subgradient Following of Variationally Penalized Objectives
di: Mo, Kai-Chia, et al.
Pubblicazione: (2024)

Power of $\ell_1$-Norm Regularized Kaczmarz Algorithms for High-Order Tensor Recovery
di: Henneberger, Katherine, et al.
Pubblicazione: (2024)

Qualitative Analysis and Adaptive Boosted DCA for Generalized Multi-Source Weber Problems
di: Long, Vo Si Trong, et al.
Pubblicazione: (2024)

Sparse Signal Reconstruction for Overdispersed Low-photon Count Biomedical Imaging Using $\ell_p$ Total Variation
di: Lu, Yu, et al.
Pubblicazione: (2024)

On the Nature of Regularity Assumptions in Bilevel Optimization with Constrained Lower-level Problem
di: Jiang, Xiaotian, et al.
Pubblicazione: (2026)