𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Numerical solution for optimization over the efficient set by d.c. optimization algorithms

✍ Scribed by Le Thi Hoai An; Pham Dinh Tao; Le Dung Muu

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
884 KB
Volume
19
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Characterizations of Nonemptiness and Co
Characterizations of Nonemptiness and Compactness of the Set of Weakly Efficient Solutions for Convex Vector Optimization and Applications
✍ X.X. Huang; X.Q. Yang πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 134 KB

In this paper, we give characterizations for the nonemptiness and compactness of the set of weakly efficient solutions of an unconstrained/constrained convex vector optimization problem with extended vector-valued functions in terms of the 0-coercivity of some scalar functions. Finally, we apply the

Optimization of Pearlβ€˜s method of condit
Optimization of Pearlβ€˜s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem : A. Becker and D. Geiger
πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 78 KB

Forthcoming Papers ## A. Becker and D. Geiger, Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem We show how to find a small loop curser in a Bayesian network. Finding such a loop cutset is the first step in the method of c