Related papers: On Constraint Qualifications of a Nonconvex Inequa…
Constrained optimization problems where both the objective and constraints may be nonsmooth and nonconvex arise across many learning and data science settings. In this paper, we show for any Lipschitz, weakly convex objectives and…
We consider a partially overdetermined problem for the $p$-Laplace equation in a convex cone $\mathcal{C}$ intersected with the exterior of a smooth bounded domain $\overline{\Omega}$ in $\mathbb{R}^n$($n\geq2$). First, we establish the…
Quasar convexity is a condition that allows some first-order methods to efficiently minimize a function even when the optimization landscape is non-convex. Previous works develop near-optimal accelerated algorithms for minimizing this class…
We provide three new proofs of the strong concavity of the dual function of some convex optimization problems. For problems with nonlinear constraints, we show that the the assumption of strong convexity of the objective cannot be weakened…
We introduce and study various algorithms for solving nonconvex minimization with inequality constraints, based on the construction of convex surrogate envelopes that majorize the objective and the constraints. In the case where the…
In the present paper we establish some new integral inequalities analogous to the well known Hadamard inequality by using a fairly elementary analysis.
This paper introduces a new extragradient-type algorithm for a class of nonconvex-nonconcave minimax problems. It is well-known that finding a local solution for general minimax problems is computationally intractable. This observation has…
In this paper, without requiring any constraint qualifications, we establish tight error bounds for the log-determinant cone, which is the closure of the hypograph of the perspective function of the log-determinant function. This error…
In this paper we consider the variable inequality problem, that is, to find a solution of the inclusion given by the sum of a function and a point-to-cone application. This problem can be seen as a generalization of the classical system…
We prove a lower bound on the number of the convex components of a compact set with non-empty interior in $\mathbb{R}^n$ for all $n\ge2$. Our result generalizes and improves the inequalities previously obtained in M. Carozza, F. Giannetti,…
Second-order optimality conditions for vector nonlinear programming problems with inequality constraints are studied in this paper. We introduce a new second-order constraint qualification, which includes Mangasarian-Fromovitz constraint…
Normed spaces appear to have very little going for them: aside from the hackneyed linear structure, you get a norm whose only virtue, aside from separating points, is the Triangle Inequality. What could you possibly prove with that? As it…
Functions that are piecewise defined are a common sight in mathematics while convexity is a property especially desired in optimization. Suppose now a piecewise-defined function is convex on each of its defining components - when can we…
We provide an amendment to the first theorem of "Control Contraction Metrics: Convex and Intrinsic Criteria for Nonlinear Feedback Design" by Manchester & Slotine in the form of an additional technical condition required to show…
This is a commentary on the CP 2003 paper "Efficient cnf encoding of boolean cardinality constraints". After recalling its context, we outline a classification of Constraints with respect to their deductive power regarding General Arc…
We construct a class of bounded domains, on which the squeezing function is not uniformly bounded from below near a smooth and pseudoconvex boundary point.
In this paper, we establish some new integral inequalities for $(\alpha, m)-$convex functions and quasi-convex functions, respectively. Our results in special cases recapture known results.
Nearly convex sets play important roles in convex analysis, optimization and theory of monotone operators. We give a systematic study of nearly convex sets, and construct examples of subdifferentials of lower semicontinuous convex functions…
A considerable amount of literature in the theory of inequality is devoted to the study of Jensen's and Young's inequality. This article presents a number of new inequalities involving the log-convex functions and the geometrically convex…
This study focuses on convex functions and their generalized. Thus, we start this study by giving the definition of convex functions and some of their properties and discussing a simple geometric property. Then we generalize E-convex…