<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Universidad</title>
<link href="https://repositorio.uoh.cl/handle/611/990" rel="alternate"/>
<subtitle/>
<id>https://repositorio.uoh.cl/handle/611/990</id>
<updated>2026-04-07T20:10:07Z</updated>
<dc:date>2026-04-07T20:10:07Z</dc:date>
<entry>
<title>TOWARDS SUPREMUM-SUM SUBDIFFERENTIAL CALCULUS FREE OF QUALIFICATION CONDITIONS</title>
<link href="https://repositorio.uoh.cl/handle/611/946" rel="alternate"/>
<author>
<name>Correa, R</name>
</author>
<author>
<name>Hantoute, A</name>
</author>
<author>
<name>López, MA</name>
</author>
<id>https://repositorio.uoh.cl/handle/611/946</id>
<updated>2024-04-16T13:20:20Z</updated>
<published>2016-01-01T00:00:00Z</published>
<summary type="text">TOWARDS SUPREMUM-SUM SUBDIFFERENTIAL CALCULUS FREE OF QUALIFICATION CONDITIONS
Correa, R; Hantoute, A; López, MA
We give a formula for the subdifferential of the sum of two convex functions where one of them is the supremum of an arbitrary family of convex functions. This is carried out under a weak assumption expressing a natural relationship between the lower semicontinuous envelopes of the data functions in the domain of the sum function. We also provide a new rule for the subdifferential of the sum of two convex functions, which uses a strategy of augmenting the involved functions. The main feature of our analysis is that no continuity-type condition is required. Our approach allows us to unify, recover, and extend different results in the recent literature.
</summary>
<dc:date>2016-01-01T00:00:00Z</dc:date>
</entry>
</feed>
