No label defined (Q4658171)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2146464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2146464 |
Statements
15 March 2005
0 references
multicriterial minimization problem
0 references
barrier vector
0 references
Slater solution
0 references
0.8260558247566223
0 references
0.7816687822341919
0 references
From the Introduction: ``Let us consider the multicriterial minimization problem: \[ \min_{v\in C}f(v),\quad C=\{v\in{\mathbb R}^n\mid g(v)\leq0\} \leqno{(1)} \] with \(f\colon{\mathbb R}^n\to{\mathbb R}^p\), \(p\geq2\); \(g\colon{\mathbb R}^n\to{\mathbb R}^m\), \(m\geq1\), where \(f\) and \(g\) are continuous functions with convex components and \(f\) is such that \[ (\exists)(f_0\in{\mathbb R}^p),\; f(v)\geq f_0,\quad (\forall)(v\in{\mathbb R}^n). \leqno{(2)} \] The vectorial partial order is the usual one (by components), the strict order being for all components.'' ``We propose two iterative methods of the penalty - Morrison type for approximating a Slater solution of the problem.''
0 references