Related papers: On Constraint Qualifications of a Nonconvex Inequa…
We study disjunctive conic sets involving a general regular (closed, convex, full dimensional, and pointed) cone K such as the nonnegative orthant, the Lorentz cone or the positive semidefinite cone. In a unified framework, we introduce…
Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…
The object of investigation in this paper are vector nonlinear programming problems with cone constraints. We introduce the notion of a Fritz John pseudoinvex cone-constrained vector problem. We prove that a problem with cone constraints is…
In this paper we first extend the diminishing stepsize method for nonconvex constrained problems presented in [4] to deal with equality constraints and a nonsmooth objective function of composite type. We then consider the particular case…
We derive bounds relating Renegar's condition number to quantities that govern the statistical performance of convex regularization in settings that include the $\ell_1$-analysis setting. Using results from conic integral geometry, we show…
The main goal of this article is to find the exact difference between a convex function and its secant, as a limit of positive quantities. This idea will be expressed as a convex inequality that leads to refinements and reversals of well…
We study some properties convex functions fulfill. Among the conclusions we obtain from such result, we are able to prove some nontrivial inequalities among real numbers, and we give an improvement of the reverse triangle inequality in the…
This paper studies system theoretic properties of the class of difference inclusions of convex processes. We will develop a framework considering eigenvalues and eigenvectors, weakly and strongly invariant cones, and a decomposition of…
In [R. Andreani, G. Haeser, L. M. Mito, H. Ram\'irez C., Weak notions of nondegeneracy in nonlinear semidefinite programming, arXiv:2012.14810, 2020] the classical notion of nondegeneracy (or transversality) and Robinson's constraint…
In [B1, Theorem 2.36] we proved the equivalence of six conditions on a continuous function f on an interval. These conditions define a subset of the set of operator convex functions, whose elements are called strongly operator convex. Two…
The aim of this paper is to study a wide class of non-convex sweeping processes with moving constraint whose translation and deformation are represented by regulated functions, i.e., functions of not necessarily bounded variation admitting…
A convex optimization problem in conic form involves minimizing a linear functional over the intersection of a convex cone and an affine subspace. In some cases, it is possible to replace a conic formulation using a certain cone, with a…
By considering a fixed point in unit disk $\Delta$, a new class of univalent convex functions is defined. Coefficient inequalities, integral operator and extreme points of this class are obtained.
We revisit the classical dual ascent algorithm for minimization of convex functionals in the presence of linear constraints, and give convergence results which apply even for non-convex functionals. We describe limit points in terms of the…
The mean value inequality is characteristic for upper semicontinuous functions to be subharmonic. Quasinearly subharmonic functions generalize subharmonic functions. We find the necessary and sufficient conditions under which subsets of…
We investigate the character of the linear constraints which are needed for Poincar\'e and Korn type inequalities to hold. We especially analyze constraints which depend on restriction on subsets of positive measure and on the trace on a…
This paper deals with some geometrical properties of solutions of some semilinear elliptic equations in bounded convex domains or convex rings. Constant boundary conditions are imposed on the single component of the boundary when the domain…
In recent developments, a novel set of necessary optimality conditions for mixed constrained optimal control problems, termed the asymptotic weak maximum principle, has been formulated. These novel conditions deviate from the classical ones…
Self-concordant barriers are essential for interior-point algorithms in conic programming. To speed up the convergence it is of interest to find a barrier with the lowest possible parameter for a given cone. The barrier parameter is a…
We introduce and study a generalized concept of boundedness of a subset of a normed vector space with respect to a cone, which is defined as lower boundedness of the images of the underlying set through all the positive functionals of the…