Related papers: On relationships between vector variational inequa…
We prove the optimal regularity for some class of vector-valued variational inequalities with gradient constraints. We also give a new proof for the optimal regularity of some scalar variational inequalities with gradient constraints. In…
In this paper, we establish Hermite-Hadamard inequality for interval-valued convex function on the co-ordinates on the rectangle from the plane. We also present Hermite-Hadamard inequality for the product of interval-valued convex functions…
In this paper, we present a unified analysis of methods for such a wide class of problems as variational inequalities, which includes minimization problems and saddle point problems. We develop our analysis on the modified Extra-Gradient…
For those acquainted with CVX (aka disciplined convex programming) of M. Grant and S. Boyd, the motivation of this work is the desire to extend the scope of CVX beyond convex minimization -- to convex-concave saddle point problems and…
In this paper, we propose a general algorithmic framework for first-order methods in optimization in a broad sense, including minimization problems, saddle-point problems, and variational inequalities. This framework allows obtaining many…
As a foundation for optimization, convexity is useful beyond the classical settings of Euclidean and Hilbert space. The broader arena of nonpositively curved metric spaces, which includes manifolds like hyperbolic space, as well as metric…
The purpose of this paper is to propose and analyze a multi-step iterative algorithm to solve a convex optimization problem and a fixed point problem posed on a Hadamard space. The convergence properties of the proposed algorithm are…
This paper is concerned with the directional derivative of the value function for a very general set-constrained optimization problem under perturbation. Under reasonable assumptions, we obtain upper and lower estimates for the upper and…
We consider the differentiation of the value function for parametric optimization problems. Such problems are ubiquitous in Machine Learning applications such as structured support vector machines, matrix factorization and min-min or…
The main aim of the present note is to prove new Hadamard like integral inequalities for the product of the convex functions.
We propose stochastic variance reduced algorithms for solving convex-concave saddle point problems, monotone variational inequalities, and monotone inclusions. Our framework applies to extragradient, forward-backward-forward, and…
We consider a class of infinite-dimensional optimization problems in which a distributed vector-valued variable should pointwise almost everywhere take values from a given finite set $\mathcal{M}\subset\mathbb{R}^m$. Such hybrid…
Various results based on some convexity assumptions (involving the exponential map along with affine maps, geodesics and convex hulls) have been recently established on Hadamard manifolds. In this paper we prove that these conditions are…
This paper addresses a class of nonsmooth and nonconvex optimization problems defined on complete Riemannian manifolds. The objective function has a composite structure, combining convex, differentiable, and lower semicontinuous terms,…
Some extremalities for quadrature operators are proved for convex functions of higher order. Such results are known in the numerical analysis, however they are often proved under suitable differentiability assumptions. In our considerations…
We investigate a mixed 0-1 conic quadratic optimization problem with indicator variables arising in mean-risk optimization. The indicator variables are often used to model non-convexities such as fixed charges or cardinality constraints.…
New proofs of the classical Hermite-Hadamard inequality are presented and several applications are given, including Hadamard-type inequalities for the functions, whose derivatives have inflection points or whose derivatives are convex.…
Support vector machines have attracted much attention in theoretical and in applied statistics. Main topics of recent interest are consistency, learning rates and robustness. In this article, it is shown that support vector machines are…
Since the seminal papers by Giannessi, an interesting topic in vector optimization has been the characterization of (weak) efficiency thorough Minty and Stampacchia type variational inequalities. Several results have been proved to extend…
We study the connection between a multitime scalar variational problem (SVP), a multitime vector variational problem (VVP) and a multitime vector fractional variational problem (VFP). For (SVP), we establish necessary optimality conditions.…