Related papers: Optimal sine and sawtooth inequalities
We present a stochastic setting for optimization problems with nonsmooth convex separable objective functions over linear equality constraints. To solve such problems, we propose a stochastic Alternating Direction Method of Multipliers…
This paper is devoted to the study of approximate solutions for a multiobjective interval-valued optimization problem based on an interval order. We establish new existence theorems of approximate solutions for such a problem under some…
In this paper, an optimal consensus problem with local inequality constraints is studied for a network of single-integrator agents. The goal is that a group of single-integrator a gents rendezvous at the optimal point of the sum of local…
The paper is devoted to obtain first and second order necessary optimality conditions for continuous-time optimization problems with equality and inequality constraints. A full rank type regularity condition along with an uniform implicit…
We give the rate of convergence of some optimal lower Riemann-Stieltjes sums toward the integral.
Given a natural number $k\ge 2$, we consider the $k$-submodular cover problem ($k$-SC). The objective is to find a minimum cost subset of a ground set $\mathcal{X}$ subject to the value of a $k$-submodular utility function being at least a…
The Subset Sum Ratio problem (SSR) asks, given a multiset $A$ of positive integers, to find two disjoint subsets of $A$ such that the largest-to-smallest ratio of their sums is minimized. In this paper we study the $k$-version of SSR,…
This paper presents a series of general results about the optimal estimation of physical transformations in a given symmetry group. In particular, it is shown how the different symmetries of the problem determine different properties of the…
Let S_k be the k-th partial sum of Banach space valued independent identically distributed random variables. In this paper, we compare the tail distribution of ||S_k|| with that of ||S_j||, and deduce some tail distribution maximal…
A general class of nonconvex optimization problems is considered, where the penalty is the composition of a linear operator with a nonsmooth nonconvex mapping, which is concave on the positive real line. The necessary optimality condition…
The paper introduces several new concepts for solving nonconvex or nonsmooth optimization problems, including convertible nonconvex function, exact convertible nonconvex function and differentiable convertible nonconvex function. It is…
We study the single-sink buy-at-bulk problem with an unknown cost function. We wish to route flow from a set of demand nodes to a root node, where the cost of routing x total flow along an edge is proportional to f(x) for some concave,…
While discounted payoff games and classic games that reduce to them, like parity and mean-payoff games, are symmetric, their solutions are not. We have taken a fresh view on the properties that optimal solutions need to have, and devised a…
In this article we study optimal control problems for systems that are affine in one part of the control variable. Finitely many equality and inequality constraints on the initial and final values of the state are considered. We investigate…
The purpose of this note is to provide a summary of the recent work of the authors on two variations of the pointwise convergence problem for the solutions to the fractional Schr\"odinger equations; convergence along a tangential line and…
In the paper we study a special parameter containing algebraic inequality involving sum of reciprocals and product of positive real numbers whose sum is 1. We determine the best values of the parameter using a new optimization argument. In…
This paper considers stochastic first-order algorithms for convex-concave minimax problems of the form $\min_{\bf x}\max_{\bf y}f(\bf x, \bf y)$, where $f$ can be presented by the average of $n$ individual components which are $L$-average…
This paper presents a polynomial-time $1/2$-approximation algorithm for maximizing nonnegative $k$-submodular functions. This improves upon the previous $\max\{1/3, 1/(1+a)\}$-approximation by Ward and \v{Z}ivn\'y~(SODA'14), where…
In this paper, we investigate the distribution of the maximum of partial sums of certain cubic exponential sums, commonly known as "Birch sums". Our main theorem gives upper and lower bounds (of nearly the same order of magnitude) for the…
We study the problem of optimizing nonlinear objective functions over bipartite matchings. While the problem is generally intractable, we provide several efficient algorithms for it, including a deterministic algorithm for maximizing convex…