𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Quasi M-convex and L-convex functions—quasiconvexity in discrete optimization

✍ Scribed by Kazuo Murota; Akiyoshi Shioura

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
298 KB
Volume
131
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis

We introduce two classes of discrete quasiconvex functions, called quasi M-and L-convex functions, by generalizing the concepts of M-and L-convexity due to Murota (Adv. Math. 124 (1996) 272) and (Math. Programming 83 (1998) 313). We investigate the structure of quasi Mand L-convex functions with respect to level sets, and show that various greedy algorithms work for the minimization of quasi M-and L-convex functions.

📜 SIMILAR VOLUMES

Extension of M-Convexity and L-Convexity
Extension of M-Convexity and L-Convexity to Polyhedral Convex Functions
✍ Kazuo Murota; Akiyoshi Shioura 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 454 KB

The concepts of M-convex and L-convex functions were proposed by Murota in 1996 as two mutually conjugate classes of discrete functions over integer lattice points. M/L-convex functions are deeply connected with the well-solvability in nonlinear combinatorial optimization with integer variables. In

Quasi-convex functions and applications
Quasi-convex functions and applications to optimality conditions in nonlinear programming
✍ A. Hassouni; A. Jaddar 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 214 KB

## Communicated by F. Clarke Abstract--We establish necessary and sufficient optimality conditions for quasi-convex programming. First, we treat some properties of the normal cone to the level set of a lower semicontinuous quasi-convex function defined on a Banach space. Next, we get our condition

Optimal synthesis in grid schemes for qu
Optimal synthesis in grid schemes for quasi-convex approximation functions
✍ N.V Mel'nikova; A.M Taras'yev 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 556 KB

A single grid algorithm which constructs the value function and the optimal synthesis, based on a local quasi-differential approximations of the Hamilton-Jacobi equation, is considered. The optimal synthesis is generated by the method of extremal translation in the direction of generalized gradients

s-Orlicz Convex Functions in Linear Spac
s-Orlicz Convex Functions in Linear Spaces and Jensen's Discrete Inequality
✍ Sever S. Dragomir; Simon Fitzpatrick 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 250 KB

In this paper we consider the class of s-Orlicz convex functions defined on a s-Orlicz convex subset of a real linear space. Some inequalities of Jensen's type for this class of mappings are pointed out.