Functional inequalities and theorems of the alternative involving composite functions
https://doi.org/10.1007/s10898-013-0100-zPublisher, magazine: ,
Publication year: 2014
Lưu Trích dẫn Chia sẻAbstract
We propose variants of non-asymptotic dual transcriptions for the functional inequality of the form f+g+k∘H≥h. The main tool we used consists in purely algebraic formulas on the epigraph of the Legendre-Fenchel transform of the function f+g+k∘H that are satisfied in various favorable circumstances. The results are then applied to the contexts of alternative type theorems involving composite and DC functions. The results cover several Farkas-type results for convex or DC systems and are general enough to face with unpublished situations. As applications of these results, nonconvex optimization problems with composite functions, convex composite problems with conic constraints are examined at the end of the paper. There, strong duality, stable strong duality results for these classes of problems are established. Farkas-type results and stable form of these results for the corresponding systems involving composite functions are derived as well.
Tags: Functional inequalities; Alternative type theorems; Farkas-type results; Stable strong duality; Stable Farkas lemma; Set containments; Nonconvex composite optimization problems; Convex composite problems with conic constraints.
Các bài viết liên quan đến tác giả Nguyễn Định
Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
Farkas-type results and duality for DC programs with convex constraints
Liberating the subgradient optimality conditions from constraint qualifications
From linear to convex systems: consistency, Farkas’ lemma and applications
Directional Kuhn-Tucker condition and duality for quasidifferentiable programs