scientific article; zbMATH DE number 1393065

zbMath0953.90046MaRDI QIDQ4936260

Teemu Pennanen

Publication date: 27 January 2000

Full work available at URL: https://eudml.org/doc/120749

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

optimality conditionsconvex programmingconvex mapping

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)

Related Items (10)

Some conjugation formulas and subdifferential formulas of convex analysis revisited ⋮ An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming ⋮ A note on the K-epigraph ⋮ On \(k\)-convex polygons ⋮ New constraint qualification and conjugate duality for composed convex optimization problems ⋮ Duality principles for optimization problems dealing with the difference of vector-valued convex mappings ⋮ Convex duality in optimal investment and contingent claim valuation in illiquid markets ⋮ On directional derivatives for cone-convex functions ⋮ High-Order Optimization Methods for Fully Composite Problems ⋮ A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications

This page was built for publication: