Related papers: Generalized-Hukuhara Subdifferential Analysis and …
This work provides calculus for the Fr\'echet and limiting subdifferential of the pointwise supremum given by an arbitrary family of lower semicontinuous functions. We start our study showing fuzzy results about the Fr\'echet…
Many recent studies on first-order methods (FOMs) focus on \emph{composite non-convex non-smooth} optimization with linear and/or nonlinear function constraints. Upper (or worst-case) complexity bounds have been established for these…
In this paper, an inexact proximal-point penalty method is studied for constrained optimization problems, where the objective function is non-convex, and the constraint functions can also be non-convex. The proposed method approximately…
We resolve the min-max complexity of distributed stochastic convex optimization (up to a log factor) in the intermittent communication setting, where $M$ machines work in parallel over the course of $R$ rounds of communication to optimize…
This research studies a non-convex geometric optimization problem arising from the field of optical wireless power transfer. In the considered optimization problem, the cost function is a sum of negatively and fractionally powered distances…
We study a variant of the \emph{generalized assignment problem} ({\sf GAP}) with group constraints. An instance of {\sf Group GAP} is a set $I$ of items, partitioned into $L$ groups, and a set of $m$ uniform (unit-sized) bins. Each item $i…
The auxiliary function method allows computation of extremal long-time averages of functions of dynamical variables in autonomous nonlinear ordinary differential equations via convex optimization. For dynamical systems defined by autonomous…
This paper makes several important contributions to the literature about nonparametric instrumental variables (NPIV) estimation and inference on a structural function $h_0$ and its functionals. First, we derive sup-norm convergence rates…
This paper concerns an optimization algorithm for unconstrained non-convex problems where the objective function has sparse connections between the unknowns. The algorithm is based on applying a dissipation preserving numerical integrator,…
In this paper we propose a new concept of differentiability for interval-valued functions. This concept is based on the properties of the Hausdorff-Pompeiu metric and avoids using the generalized Hukuhara difference.
In this paper we introduce new methods for convex optimization problems with inexact stochastic oracle. First method is an extension of the intermediate gradient method proposed by Devolder, Glineur and Nesterov for problems with inexact…
We analyze a high order unfitted hybridizable discontinuous Galerkin (HDG) method for an optimal control problem governed by a convection-diffusion equation posed in a domain with piecewise-wise $\mathcal{C}^2$ boundary $\partial \Omega$.…
The subdifferential of a function is a generalization for nonsmooth functions of the concept of gradient. It is frequently used in variational analysis, particularly in the context of nonsmooth optimization. The present work proposes…
Many resource allocation tasks are challenging global (i.e., non-convex) optimization problems. The main issue is that the computational complexity of these problems grows exponentially in the number of variables instead of polynomially as…
Sparsity-promoting terms are incorporated into the objective functions of optimal control problems in order to ensure that optimal controls vanish on large parts of the underlying domain. Typical candidates for those terms are integral…
Submodular optimization finds applications in machine learning and data mining. In this paper, we study the problem of maximizing functions of the form $h = f-c$, where $f$ is a monotone, non-negative, weakly submodular set function and $c$…
This paper focuses on the minimization of a sum of a twice continuously differentiable function $f$ and a nonsmooth convex function. An inexact regularized proximal Newton method is proposed by an approximation to the Hessian of $f$…
In this paper, we present a conditional gradient type (CGT) method for solving a class of composite optimization problems where the objective function consists of a (weakly) smooth term and a (strongly) convex regularization term. While…
The paper concerns the optimal upper bounds on the expectations of the kth record values (k >= 1) centered about the sample mean. We consider the case, when the records are based on the infinite sequence of the independent identically…
In this paper, we propose new first-order methods for minimization of a convex function on a simple convex set. We assume that the objective function is a composite function given as a sum of a simple convex function and a convex function…