Related papers: Reduction of Exhausters by Set Order Relations and…
Exhausters are families of compact, convex sets which provide minmax or maxmin representations of positively homogeneous functions and they are efficient tools for the study of nonsmooth function. Upper and lower exhausters of positively…
Exhausters are families of convex compact sets that allow one to represent directional derivative of the studied function at the considered point in the form of InfMax or SupMin of linear functions. Functions for which such a representation…
Exhausters and coexhausters are notions of constructive nonsmooth analysis which are used to study extremal properties of functions. An upper exhauster (coexhauster) is used to get an approximation of a considered function in the…
We introduce an extended tangent cone of high order to a set and study its properties. Then we use this local approximation for deriving high-order necessary conditions for local minimizers of constrained optimization problems.
In this paper, we propose a new approach to design globally convergent reduced-order observers for nonlinear control systems via contraction analysis and convex optimization. Despite the fact that contraction is a concept naturally suitable…
This paper explores local second-order weak sharp minima for a broad class of nonconvex optimization problems. We propose novel second-order optimality conditions formulated through the use of classical and lower generalized support…
In this paper, we introduce a new second-order directional derivative and a second-order subdifferential of Hadamard type for an arbitrary nondifferentiable function. We derive several second-order optimality conditions for a local and a…
This paper investigates new first-order optimality conditions for general optimization problems. These optimality conditions are stronger than the commonly used M-stationarity conditions and are in particular useful when the latter cannot…
We present a unified study of first and second order necessary and sufficient optimality conditions for minimax and Chebyshev optimisation problems with cone constraints. First order optimality conditions for such problems can be formulated…
In this paper we derive new second-order optimality conditions for a very general set-constrained optimization problem where the underlying set may be nononvex. We consider local optimality in specific directions (i.e., optimal in a…
This paper presents a framework to solve constrained optimization problems in an accelerated manner based on High-Order Tuners (HT). Our approach is based on reformulating the original constrained problem as the unconstrained optimization…
In this paper we study second-order optimality conditions for non-convex set-constrained optimization problems. For a convex set-constrained optimization problem, it is well-known that second-order optimality conditions involve the support…
In recent years, semidefinite relaxations of common optimization problems in robotics have attracted growing attention due to their ability to provide globally optimal solutions. In many cases, it was shown that specific handcrafted…
This paper investigates the optimality conditions for characterizing the local minimizers of the constrained optimization problems involving an $\ell_p$ norm ($0<p<1$) of the variables, which may appear in either the objective or the…
We consider the minimization of submodular functions subject to ordering constraints. We show that this optimization problem can be cast as a convex optimization problem on a space of uni-dimensional measures, with ordering constraints…
Via a family of monotone scalar functions, a preorder on a set is extended to its power set and then used to construct a hull operator and a corresponing complete lattice of sets. A function mappping into the preordered set is extended to a…
This paper addresses two related problems in optimal control. The first investigation consists of compatibility issues between two classical approaches to deriving necessary conditions for optimal control problems with a final target: the…
Convex optimization with equality and inequality constraints is a ubiquitous problem in several optimization and control problems in large-scale systems. Recently there has been a lot of interest in establishing accelerated convergence of…
In the present paper, some aspects of the finite-dimensional theory of set-inclusive generalized equations are studied. Set-inclusive generalized equations are problems arising in several contexts of optimization and variational analysis,…
In this paper, we analyze optimal control problems governed by semilinear parabolic equations. Box constraints for the controls are imposed and the cost functional involves the state and possibly a sparsity-promoting term, but not a…