Convex composite non-Lipschitz programming
https://doi.org/10.1007/s101070100274Publisher, magazine: ,
Publication year: 2002
Lưu Trích dẫn Chia sẻAbstract
Necessary and sufficient optimality conditions are given for the following problem: \[ \min(g\circ F)(x),\text{ s.t. }x\in C, f_i(x)\leq 0, i=1,2, \dots, m \] where \(F:\mathbb{R}^n\to \mathbb{R}^m\) is a continuous nonsmooth map, \(g:\mathbb{R}^m \to\mathbb{R}\) is a convex function, \(C\subset R^n\) is a closed convex set, and \(f_i:\mathbb{R}^n \to\mathbb{R}\) is continuous for each \(i\). This type of problems subsumes a large class of problems arising in applications.
Tags: optimality conditions
Các bài viết liên quan đến tác giả Phan Nhật Tĩnh
Convex composite non-Lipschitz programming
On conjugate maps and directional derivatives of convex vector functions
Convex vector functions and their subdifferential
Subdifferential characterization of quasiconvex and convex vector functions
On the existence of equilibrium points of vector functions
Directional Holder Metric Subregularity and Application to Tangent Cones
Metric Subregularity of Multifunctions: First and Second Order Infinitesimal Characterizations
Optimality conditions for nonsmooth vector problems in normed spaces
On Second-Order Conditions for Nonsmooth Problems with Constraints