Duality for optimization and best approximation over finite intersections

From MaRDI portal





The paper is devoted to \(m\)-Lagrangian duality for optimization and best approximation over a constrained set \(G:=\bigcap^m_{i=1} G_i\neq 0\), in a natural general framework. \([G_i]\) are closed subsets of a locally convex space \(X\). The \(m\)-Lagrangian dual problem \((Q_m)\) to the primal problem \((P)\) of minimization of a special class of convex functions, is the supremization problem of the function in \(G\). The first part deals with some results on problem \((Q_m)\) in \(X\) and on its relation with the usual Lagrange dual problem \((Q)\) to \((P)\), in the case when \(P\) has a solution. Next, it gives some applications to duality for the distance to the intersection of \(m\) closed convex sets in a normed linear space, when the nearest point exists.











This page was built for publication: Duality for optimization and best approximation over finite intersections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221452)