Skip to content

Similar papers

Preprint Sep 2026

Necessary Optimality Conditions for Bilevel Programming using Tangential Subdifferentials

The bilevel program is an optimization problem in which the constraint involves solutions to a parametric optimization problem. It is well known that the value function reformulation provides an equivalent single-level optimization problem, but it results in a nonsmooth optimization problem that never satisfies the usu...

Hui-Lin Luo · 0 citations
Preprint Sep 2026

Singular Backward SDEs for Optimal Control with State Constraints

We investigate a class of backward stochastic differential equations (BSDEs) with at most quadratic growth which explode at a possibly unbounded random horizon, defined through the first hitting of zero of an adapted Ito process. In contrast with the classical theory of singular BSDEs, the explosion is generated by the...

Mathieu Lise, N. Touzi · 0 citations
Open access Apr 2025

Bouligand Analysis and Discrete Optimal Control of Total Variation-Based Variational Inequalities

We investigate differentiability and subdifferentiability properties of the solution mapping associated with variational inequalities (VI) of the second kind involving the discrete total-variation. Bouligand differentiability of the solution operator is established via a direct quotient analysis applied to a primal-dua...

J. C. de los Reyes · 0 citations
Preprint Sep 2026

Pontryagin maximum principle for non-smooth state-constrained control problems over Wasserstein spaces

We study a state-constrained Bolza optimal control problem governed by a non-local continuity equation in the Wasserstein space $\sP_2(\R^d)$. We develop a Pontryagin maximum principle for these problems in which both the cost functionals and the constraints are only locally Lipschitz, and the initial measure does not...

Fernanda Urrea, Ernesto Treumún · 0 citations
Open access 2010

Necessary Conditions for Local Optimality in Difference-of-Convex Programming

Using ε-subdifferential calculus for difference-of-convex (d.c.) optimization, Dür proposed a condition sufficient for local optimality, and showed that this condition is not necessary in general. Here it is proved that whenever the convex part is strongly convex, this condition is also necessary. Strong convexity can...

I. Bomze, C. Lemaréchal · 12 citations
Preprint Sep 2026

Interior-point proximal methods for nonsmooth optimization in Hilbert spaces with cone-ordered constraints

We study an inexact interior-point method for nonsmooth, possibly nonconvex optimization in a Hilbert space with inequality constraints ordered by a cone in a Banach lattice, with particular emphasis on infinite-dimensional state-constrained optimal control. The objective function is given by the sum of a smooth, possi...

Behzad Azmi, Alberto De Marchi · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.