Related papers: Lipschitz continuity of solution multifunctions of…
We propose a stochastic optimization method for the minimization of the sum of three convex functions, one of which has Lipschitz continuous gradient as well as restricted strong convexity. Our approach is most suitable in the setting where…
We present a new approach to convexification of the Tikhonov regularization using a continuation method strategy. We embed the original minimization problem into a one-parameter family of minimization problems. Both the penalty term and the…
The minimization of convex objectives coming from linear supervised learning problems, such as penalized generalized linear models, can be formulated as finite sums of convex functions. For such problems, a large set of stochastic…
Graph algorithms are widely used for decision making and knowledge discovery. To ensure their effectiveness, it is essential that their output remains stable even when subjected to small perturbations to the input because frequent output…
In this work, we study data preconditioning, a well-known and long-existing technique, for boosting the convergence of first-order methods for regularized loss minimization. It is well understood that the condition number of the problem,…
We prove regularity results for the unique minimizer of the total variation functional, currently used in image processing analysis since the work by L. Rudin, S. Osher and E. Fatemi. In particular we show that if the source term $f$ is…
In this paper, we revisit the Mordukhovich's subdifferential criterion for Lipschitz continuity of nonsmooth functions and coderivative criterion for the Aubin/Lipschitz-like property of set-valued mappings in finite dimensions. The…
The Lasso is a popular regression method for high-dimensional problems in which the number of parameters $\theta_1,\dots,\theta_N$, is larger than the number $n$ of samples: $N>n$. A useful heuristics relates the statistical properties of…
The main result of this paper is to prove that viscosity solutions to a parabolic free boundary problem with variable coefficients are Lipschitz continuous under the assumptions that the solution has a Lipschitz free boundary and satisfies…
The goal of the paper is to design sequential strategies which lead to efficient optimization of an unknown function under the only assumption that it has a finite Lipschitz constant. We first identify sufficient conditions for the…
This paper presents two direct parameterizations of stable and robust linear parameter-varying state-space (LPV-SS) models. The model parametrizations guarantee a priori that for all parameter values during training, the allowed models are…
Generative models have attracted considerable attention for their ability to produce novel shapes. However, their application in mechanical design remains constrained due to the limited size and variability of available datasets. This study…
In this paper we present explicit estimate for Lipschitz constant of solution to a problem of calculus of variations. The approach we use is due to Gamkrelidze and is based on the equivalence of the problem of calculus of variations and a…
The use of generalized LASSO is a common technique for recovery of structured high-dimensional signals. Each generalized LASSO program has a governing parameter whose optimal value depends on properties of the data. At this optimal value,…
Let $F:[0,T]\times\R^n\mapsto 2^{\R^n}$ be a continuous multifunction with compact, not necessarily convex values. In this paper, we prove that, if $F$ satisfies the following Lipschitz Selection Property: \begin{itemize} \item[{(LSP)}]…
First-order optimization methods are crucial for solving large-scale data processing problems, particularly those involving convex non-smooth composite objectives. For such problems with convex non-smooth composite objectives, we introduce…
Composite optimization problems involve minimizing the composition of a smooth map with a convex function. Such objectives arise in numerous data science and signal processing applications, including phase retrieval, blind deconvolution,…
Submodular functions are relevant to machine learning for at least two reasons: (1) some problems may be expressed directly as the optimization of submodular functions and (2) the lovasz extension of submodular functions provides a useful…
It is well known that the minimum $\ell_2$-norm solution of the convex LASSO model, say $\mathbf{x}_{\star}$, is a continuous piecewise linear function of the regularization parameter $\lambda$, and its signed sparsity pattern is constant…
In this paper, we consider the pointwise boundary Lipschitz regularity of solutions for the semilinear elliptic equations in divergence form mainly under some weaker assumptions on nonhomogeneous term and the boundary. If the domain…