Focus in the paper is on the definition of linear bilevel programming problems, the existence of optimal solutions and necessary as well as sufficient optimality conditions. In the papers [9] and [10] the authors claim to suggest a refined definition of linear bilevel programming problems and related optimality conditions. Mainly their attempt reduces to shifting upper level constraints involvi...

We consider a general multiobjective optimization problem with five basic optimality principles: efficiency, weak and proper Pareto optimality, strong efficiency and lexicographic optimality. We generalize the concept of tradeoff directions defining them as some optimal surface of appropriate cones. In convex optimization, the contingent cone can be used for all optimality principles except lex...

This paper concerns second order sufficient conditions of optimality, involving the Riccati equation, for optimal control problems with periodic boundary conditions. The problems considered involve no pathwise constraints and are ‘regular’, in the sense that the strengthened Legendre-Clebsch condition is assumed to be satisfied. A well-known sufficient condition, which we refer to as the Riccat...

We provide sufficient optimality conditions for optimal control problems with bang-bang controls. Building on a structural assumption on the adjoint state, we additionally need a weak second-order condition. This second-order condition is formulated with functions from an extended critical cone, and it is equivalent to a formulation posed on measures supported on the set where the adjoint state...

Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...

We present new first and second-order optimality conditions for maximizing a function over a polyhedron. These conditions are expressed in terms of the first and second-order directional derivatives along the edges of the polyhedron, and an edge description of the polyhedron. If the objective function is quadratic and edgeconvex, and the constraint polyhedron includes a box constraint, then loc...

We establish necessary conditions of optimality for discrete-time infinite-horizon optimal control in presence of constraints at infinity. These necessary conditions are in form of weak and strong Pontryagin principles. We use a functional analytic framework and multipliers rules in Banach (sequence) spaces. We establish new properties on Nemytskii operators in sequence spaces. We also provide ...

Abstract: In this paper we study second order sufficient conditions for the strong-local optimality of singular Pontryagin extremals. In particular, we focus on the minimum-time problem for a control-affine system with vector inputs. We use Hamiltonian methods to prove that the coercivity of a suitably-defined second variation plus an involutivity assumption on the distribution of the controlle...

We consider mass-constrained minimizers for a class of non-convex energy functionals involving double-well potentials. Based upon global convex lower bounds to the energy, we introduce a simple strategy to find sufficient conditions on a given critical point (metastable state) to be a global minimizer. We show that this strategy works well for the one exact and known metastable state: the const...

In this note we prove that an extended-real-valued lower semi-continuous convex function Φ defined on a reflexive Banach space X achieves its supremum on every nonempty bounded and closed convex set of its effective domain Dom Φ, if and only if the restriction of Φ to Dom Φ is sequentially continuous with respect to the weak topology on the underlying space X .