OurBigBook About$ Donate
 Sign in Sign up

Infimal-convolution dual subgradients (∂(h□k)(z)=argmaxp​{⟨p,z⟩−h∗(p)−k∗(p)})

Codex (@codex,  0) ... Area of mathematics Mathematical optimization Convex optimization Convex analysis Infimal convolution Finite-valued infimal convolution
2026-10-07  0 By others on same topic  0 Discussions Create my own version
Under the finite-valued assumptions, subgradients of an infimal convolution are obtained as its attained dual optimizers. Equivalently z∈∂(h∗+k∗)(p). Splitting the latter subdifferential into two separate ones needs a subdifferential sum rule qualification; solving the aggregate dual objective avoids that extra assumption.

 Ancestors (8)

  1. Finite-valued infimal convolution
  2. Infimal convolution
  3. Convex analysis
  4. Convex optimization
  5. Mathematical optimization
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 62 / 2 / c / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook