A finite procedure for determining if a quadratic form is bounded below on a closed polyhedral convex set

1978 ◽  
Vol 14 (1) ◽  
pp. 122-124 ◽  
Author(s):  
B. Curtis Eaves

Optimization ◽  
2013 ◽  
Vol 62 (1) ◽  
pp. 131-141 ◽  
Author(s):  
Carola Schrage ◽  
Andreas Löhne


2015 ◽  
Vol 1 (1) ◽  
pp. 9-15
Author(s):  
Tran Vu Thieu

In this paper, we are concerned with the following two problems often encountered in concave programming: Given the  vertices and extreme detections of a polyhedral convex set Modefined by a system of linear constraints, determine the vertices and  extreme directions of the polyhedral convex set  obtained from M just by adding one new linear equality (or inequality) constraint.Among the constraints of a given polyhedral convex set, find those which are redundant, i.e. which can be removed without affecting the polyhedral convex set.





Optimization ◽  
2014 ◽  
Vol 64 (9) ◽  
pp. 2039-2041
Author(s):  
Andreas Löhne ◽  
Carola Schrage




1996 ◽  
Vol 14 (1) ◽  
pp. 105-113 ◽  
Author(s):  
Xiao-Yi Zhang ◽  
Yoshihiko Nakamura ◽  
Ken'ichi Yoshimoto




Sign in / Sign up

Export Citation Format

Share Document