Name
Abstract | ||
|---|---|---|
Mathematical programs, that become convex programs after “freezing” some variables, are termed partly convex. For such programs we give saddle-point conditions that are both necessary and sufficient that a feasible point be globally optimal. The conditions require “cooperation” of the feasible point tested for optimality, an assumption implied by lower semicontinuity of the feasible set mapping. The characterizations are simplified if certain point-to-set mappings satisfy a “sandwich condition”. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/BF01279450 | J. Global Optimization |
Keywords | Field | DocType |
90C25,90C30,90C90,Global optimum,local optimum,saddle point,point-to-set mapping,Zermelo's navigation problem | Absolutely convex set,Mathematical optimization,Nonlinear programming,Subderivative,Feasible region,Proper convex function,Convex optimization,Mathematics,Convex analysis,Linear matrix inequality | Journal |
Volume | Issue | ISSN |
7 | 3 | 0925-5001 |
Citations | PageRank | References |
2 | 0.58 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sanjo Zlobec | 1 | 54 | 14.44 |