English
Related papers

Related papers: Sparse optimization problems in fractional order S…

200 papers

In this paper, we propose a sparse least squares (SLS) optimization model for solving multilinear equations, in which the sparsity constraint on the solutions can effectively reduce storage and computation costs. By employing variational…

Optimization and Control · Mathematics 2023-10-10 Xin Li , Ziyan Luo , Yang Chen

We introduce sparse versions of function spaces that are relevant to characterize the solutions of Euler equations without concentration. The standard Sobolev space $H^{-1}$ is given a sparse structure that allows to measure the degree of…

Analysis of PDEs · Mathematics 2026-05-27 Óscar Domínguez , Mario Milman

Interest in stochastic zeroth-order (SZO) methods has recently been revived in black-box optimization scenarios such as adversarial black-box attacks to deep neural networks. SZO methods only require the ability to evaluate the objective…

Machine Learning · Statistics 2020-11-11 Mayumi Ohta , Nathaniel Berger , Artem Sokolov , Stefan Riezler

The homogeneous second-order descent method (Zhang et al. 2025, Mathematics of Operations Research) was initially proposed for unconstrained optimisation problems. HSODM shows excellent performance with respect to the global complexity rate…

Optimization and Control · Mathematics 2026-04-08 Yonggang Pei , Yubing Lin , Mauricio Silva Louzeiro , Detong Zhu

This work investigates the Sobolev regularity of solutions to perturbed fractional 1-Laplace equations. Under the assumption that weak solutions are locally bounded, we establish that the regularity properties are analogous to those…

Analysis of PDEs · Mathematics 2025-10-17 Dingding Li , Chao Zhang

We present a novel algorithm that allows us to gain detailed insight into the effects of sparsity in linear and nonlinear optimization, which is of great importance in many scientific areas such as image and signal processing, medical…

Optimization and Control · Mathematics 2021-09-23 Katharina Bieker , Bennet Gebken , Sebastian Peitz

This paper studies the complexity of finding an $\epsilon$-stationary point for stochastic bilevel optimization when the upper-level problem is nonconvex and the lower-level problem is strongly convex. Recent work proposed the first-order…

Optimization and Control · Mathematics 2026-03-10 Lesi Chen , Junru Li , El Mahdi Chayti , Jingzhao Zhang

We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded error. In applications of this method to semidefinite programs,…

Optimization and Control · Mathematics 2008-05-16 Alexandre d'Aspremont

Higher Sobolev and H\"older regularity is studied for local weak solutions of the fractional $p$-Laplace equation of order $s$ in the case $p\ge 2$. Depending on the regime considered, i.e. $$0<s\le\tfrac{p-2}{p}\quad \text{or}…

Analysis of PDEs · Mathematics 2024-06-04 Verena Bögelein , Frank Duzaar , Naian Liao , Giovanni Molica Bisci , Raffaella Servadei

We construct fractional Sobolev spaces on arbitrary time scales, both in one dimension and on product time scales. In 1D, we define $W^{\alpha(\cdot),p}_{\mathrm{rd}}(\mathcal I)$ through a variable-order Gagliardo-type seminorm and prove…

Dynamical Systems · Mathematics 2026-03-10 Hafida Abbas , Abdelhalim Azzouz

We propose a stochastic variance reduced optimization algorithm for solving sparse learning problems with cardinality constraints. Sufficient conditions are provided, under which the proposed algorithm enjoys strong linear convergence…

Machine Learning · Computer Science 2017-12-27 Xingguo Li , Raman Arora , Han Liu , Jarvis Haupt , Tuo Zhao

This paper studies smoothing properties of the local fractional maximal operator, which is defined in a proper subdomain of the Euclidean space. We prove new pointwise estimates for the weak gradient of the maximal function, which imply…

Functional Analysis · Mathematics 2015-06-17 Toni Heikkinen , Juha Kinnunen , Janne Korvenpää , Heli Tuominen

Sparsity-constrained optimization underlies many problems in signal processing, statistics, and machine learning. State-of-the-art hard-thresholding (HT) algorithms rely on an appropriately selected continuous step-size parameter to ensure…

Machine Learning · Statistics 2026-05-13 Jin Zhu , Junxian Zhu , Zezhi Wang , Borui Tang , Hongmei Lin , Xueqin Wang

We study a generalized framework for structured sparsity. It extends the well-known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as part of a convex optimization problem. This framework provides…

Machine Learning · Computer Science 2011-06-28 Andreas Argyriou , Luca Baldassarre , Jean Morales , Massimiliano Pontil

In this work, we obtain an existence of nontrivial solutions to a minimization problem involving a fractional Hardy-Sobolev type inequality in the case of inner singularity. Precisely, for $\lambda>0$ we analyze the attainability of the…

Analysis of PDEs · Mathematics 2020-10-21 Antonella Ritorto

Capacitary measures form a class of measures that vanish on sets of capacity zero. These measures are compact with respect to so-called $\gamma$-convergence, which relates a sequence of measures to the sequence of solutions of relaxed…

Analysis of PDEs · Mathematics 2024-12-17 Anna Lentz

Functionally constrained stochastic optimization problems, where neither the objective function nor the constraint functions are analytically available, arise frequently in machine learning applications. In this work, assuming we only have…

Optimization and Control · Mathematics 2022-10-11 Anthony Nguyen , Krishnakumar Balasubramanian

In this paper, we investigate the existence of weak solution for a fractional type problems driven by a nonlocal operator of elliptic type in a fractional Orlicz-Sobolev space, with homogeneous Dirichlet boundary conditions. We first extend…

Analysis of PDEs · Mathematics 2020-04-03 Elhoussine Azroul , Abdelmoujib Benkirane , Mohammed Srati

Sparsity plays a central role in recent developments in signal processing, linear algebra, statistics, optimization, and other fields. In these developments, sparsity is promoted through the addition of an $L^1$ norm (or related quantity)…

Analysis of PDEs · Mathematics 2014-08-04 Russel E. Caflisch , Stanley J. Osher , Hayden Schaeffer , Giang Tran

While first-order stationary points (FOSPs) are the traditional targets of non-convex optimization, they often correspond to undesirable strict saddle points. To circumvent this, attention has shifted towards second-order stationary points…

Computational Complexity · Computer Science 2026-04-03 Andreas Kontogiannis , Ioannis Panageas , Vasilis Pollatos