𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A nonconvex, piecewise linear optimization problem

✍ Scribed by Bahia Benchekroun; James E. Falk

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
411 KB
Volume
21
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On nonconvex optimization problems with
On nonconvex optimization problems with separated nonconvex variables
✍ Hoang Tuy πŸ“‚ Article πŸ“… 1992 πŸ› Springer US 🌐 English βš– 628 KB

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

Optimality conditions for a nonconvex se
Optimality conditions for a nonconvex set-valued optimization problem
✍ MarΓ­a Alonso; Luis RodrΓ­guez-MarΓ­n πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 253 KB

In this paper we study necessary and sufficient optimality conditions for a set-valued optimization problem. Convexity of the multifunction and the domain is not required. A definition of K -approximating multifunction is introduced. This multifunction is the differentiability notion applied to the