[BOK][B] Vector optimization

J Jahn - 2009 - Springer
The continuous and increasing interest concerning vector optimization perceptible in the
research community, where contributions dealing with the theory of duality abound lately …

[BOK][B] Duality in vector optimization

RI Bot, SM Grad, G Wanka - 2009 - books.google.com
Page 1 VECTOR OPTIMIZATION Radu loan Bot Sorin-Mihai Grad Gert Wanka Duality in Vector
Optimization Springer Page 2 Vector Optimization Series Editor: Johannes Jahn University of …

[BOK][B] Conjugate duality in convex optimization

RI Bot - 2009 - books.google.com
The results presented in this book originate from the last decade research work of the author
in the? eld of duality theory in convex optimization. The reputation of duality in the …

Constraint qualifications for convex inequality systems with applications in constrained optimization

C Li, KF Ng, TK Pong - SIAM Journal on Optimization, 2008 - SIAM
For an inequality system defined by an infinite family of proper convex functions, we
introduce some new notions of constraint qualifications in terms of the epigraphs of the …

Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming

DH Fang, C Li, KF Ng - SIAM Journal on Optimization, 2010 - SIAM
For an inequality system defined by a possibly infinite family of proper functions (not
necessarily lower semicontinuous), we introduce some new notions of constraint …

A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces

RI Boţ, G Wanka - Nonlinear Analysis: Theory, Methods & Applications, 2006 - Elsevier
In this paper we present a new regularity condition for the subdifferential sum formula of a
convex function with the precomposition of another convex function with a continuous linear …

Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities

MA Goberna, V Jeyakumar, MA López - Nonlinear Analysis: Theory …, 2008 - Elsevier
In this paper we present constraint qualifications which completely characterize the Farkas–
Minkowski and the locally Farkas–Minkowski convex (possibly infinite) inequality systems …

A closedness condition and its applications to DC programs with convex constraints

N Dinh, TTA Nghia, G Vallet - Optimization, 2010 - Taylor & Francis
This paper concerns a closedness condition called (CC) involving a convex function and a
convex constrained system. This type of condition has played an important role in the study …

On strong and total Lagrange duality for convex optimization problems

RI Boţ, SM Grad, G Wanka - Journal of Mathematical Analysis and …, 2008 - Elsevier
We give some necessary and sufficient conditions which completely characterize the strong
and total Lagrange duality, respectively, for convex optimization problems in separated …

Robust linear semi-infinite programming duality under uncertainty

MA Goberna, V Jeyakumar, G Li, MA López - Mathematical Programming, 2013 - Springer
In this paper, we propose a duality theory for semi-infinite linear programming problems
under uncertainty in the constraint functions, the objective function, or both, within the …