A mathematical programming problem is said to have separated nonconvex variables when the variables can be divided into two groups: x = (xl,..., x,) and y = (Yl,. • • , Yn), such that the objective function and any constraint function is a sum of a convex function of (x, y) jointly and a nonconvex f
✦ LIBER ✦
On nonconvex optimization with integral constraints
✍ Scribed by J. G. S. Patiño
- Publisher
- Springer
- Year
- 1987
- Tongue
- English
- Weight
- 425 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0022-3239
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On nonconvex optimization problems with
✍
Hoang Tuy
📂
Article
📅
1992
🏛
Springer US
🌐
English
⚖ 628 KB
Necessary Optimality Conditions for Nonc
✍
Q.J. Zhu
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 825 KB
In this paper, we derive necessary optimality conditions for optimization problems defined by non-convex differential inclusions with endpoint constraints. We do this in terms of parametrizations of the convexified form of the differential inclusion and, under additional assumptions, in terms of the
Nondegenerate Necessary Conditions for N
✍
M.M.A Ferreira; F.A.C.C Fontes; R.B Vinter
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 106 KB
Existence for minimization with nonconve
✍
D Motreanu
📂
Article
📅
1986
🏛
Elsevier Science
🌐
English
⚖ 471 KB
On minima of variational problems with s
✍
Michael Wiegner
📂
Article
📅
1987
🏛
Springer
🌐
English
⚖ 217 KB
Nonconvex optimization problem: The infi
✍
V.A. Yakubovich
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 577 KB