Titlebook: Generalized Convexity and Related Topics; Igor V. Konnov,Dinh The Luc,Alexander M. Rubinov Conference proceedings 2006 Springer-Verlag Ber

harpsichord

Generalized Convexity and Related Topics978-3-540-37007-9Series ISSN 0075-8442 Series E-ISSN 2196-9957

assent

0075-8442 Overview: 978-3-540-37006-2978-3-540-37007-9Series ISSN 0075-8442 Series E-ISSN 2196-9957

Chandelier

Combined Relaxation Methods for Generalized Monotone Variational Inequalitiesthis approach and implementable methods both for single-valued and for multi-valued problems. All the combined relaxation methods are convergent under very mild assumptions. This is the case if there exists a solution to the dual formulation of the variational inequality problem. In general, these m

OWL

Abstract Convexity and the Monge-Kantorovich Dualityand with a given marginal difference. It includes: (1) the equivalence of the validity of duality theorems for MKP and appropriate abstract convexity of the corresponding cost functions; (2) a characterization of a (maximal) abstract cyclic monotone map .: . → . ? IR. in terms connected with the con

consent

Ondines-curse

同時(shí)發(fā)生

nephritis

Pseudomonotonicity of a Linear Map on the Interior of the Positive Orthantp) to be pseudomonotone. The given results are in terms of the sign of the determinants of the principal submatrices and of the cofactors of . in the nonsingular case and in terms of the structure of . in the singular case. A complete characterization of pseudomonotonicity in terms of the coefficien

overture

An Approach to Discrete Convexity and Its Use in an Optimal Fleet Mix Problemd the convexity of the sum of convex functions. Global optimality of local minima is then studied both for single variable functions and for multi variables ones. Finally, a concrete optimal fleet mix problem is studied, pointing out its discrete convexity properties.

avulsion

A Unifying Approach to Solve a Class of Parametrically-Convexifiable Problemsoptimal level solutions method. In other words, the problems are solved by analyzing, explicitly or implicitly, the optimal solutions of particular quadratic strictly convex parametric subproblems. In particular, it is pointed out that some of these problems share the same set of optimal level solut