✦ LIBER ✦

Quasi-convex optimization

✍ Scribed by Vasant A. Ubhaya

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 471 KB
Volume: 116
Category: Article
ISSN: 0022-247X
DOI: 10.1016/s0022-247x(86)80008-7

No coin nor oath required. For personal study only.

✦ Synopsis

Given a bounded real function f defined on a closed bounded real interval/, the problem is to find a quasi-convex function f' so as to minimize the supremum of If(s)-f'(s)] for all s in L over the class of all quasi-convex functions f' on L This article obtains optimal solutions to the problem and derives their properties. This problem arises in the context of curve fitting or estimation.

📜 SIMILAR VOLUMES

Optimal Lipschitzian selection operator

Optimal Lipschitzian selection operator in quasi-convex optimization

✍ Vasant A Ubhaya 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 367 KB

Quasi M-convex and L-convex functions—qu

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

✍ Kazuo Murota; Akiyoshi Shioura 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 298 KB

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 res

On boundedness of (quasi-)convex integer

On boundedness of (quasi-)convex integer optimization problems

✍ Wiesława T. Obuchowska 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 284 KB

Proximal quasi-Newton methods for nondif

Proximal quasi-Newton methods for nondifferentiable convex optimization

✍ Xiaojun Chen; Masao Fukushima 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 154 KB

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

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