Convex composite non-Lipschitz programming
type: Item
instance of: scholarly article
title: Convex composite non-Lipschitz programming
zbMATH Open document ID: 1019.90049
published in: Mathematical Programming. Series A. Series B
publication date: 2002-06-12T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 1754746
zbMATH Keywords: optimality conditions
author: V. Jeyakumar
author: Dinh The Luc
author: Phan Nhat Tinh
reviewed by: Joachim Piehler
MaRDI profile type: Publication
full work available at URL: s101070100274
OpenAlex ID: W1997880975
DOI: 10.1007/S101070100274
description: scientific article; zbMATH DE number 1754746