Generalized Farkas’ lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization

2015 ◽  
Vol 64 (4) ◽  
pp. 679-702 ◽  
Author(s):  
V. Jeyakumar ◽  
G. M. Lee ◽  
N. T. H. Linh
Keyword(s):  
Quadratic Optimization ◽  
Farkas Lemma ◽  
Dc Optimization

scholarly journals The Farkas lemma of Shimizu, Aiyoshi and Katayama

1985 ◽  
Vol 31 (3) ◽  
pp. 445-450 ◽  
Author(s):  
Charles Swartz
Keyword(s):  
Convex Programming ◽  
Infinite Dimensional ◽  
Farkas Lemma ◽  
Finite Dimensional

Shimizu, Aiyoshi and Katayama have recently given a finite dimensional generalization of the classical Farkas Lemma. In this note we show that a result of Pshenichnyi on convex programming can be used to give a generalization of the result of Shimizu, Aiyoshi and Katayama to infinite dimensional spaces. A generalized Farkas Lemma of Glover is also obtained.

An Inexact Sequential Quadratic Optimization Algorithm for Nonlinear Optimization

2014 ◽  
Vol 24 (3) ◽  
pp. 1041-1074 ◽  
Author(s):  
Frank E. Curtis ◽  
Travis C. Johnson ◽  
Daniel P. Robinson ◽  
Andreas Wächter
Keyword(s):  
Nonlinear Optimization ◽  
Optimization Algorithm ◽  
Quadratic Optimization ◽  
Sequential Quadratic Optimization
Sign in / Sign up

Export Citation Format

Share Document