New Farkas-type constraintqualifications in convex infinite programming (original) (raw)

Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming

Gokhan Ozevin

SIAM Journal on Optimization, 2010

View PDFchevron_right

From linear to convex systems: Consistency, Farkas' lemma and applications

Miguel Goberna

2005

View PDFchevron_right

New glimpses on convex infinite optimization duality

Miguel Goberna

Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas, 2014

View PDFchevron_right

Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions

Nader Kanzi

2012

View PDFchevron_right

Primal and dual optimality criteria in convex programming

AHARON ben-Tal

Zeitschrift für Operations Research, 1977

View PDFchevron_right

Convex Inequalities Without Constraint Qualification nor Closedness Condition, and Their Applications in Optimization

nghia dinh

2010

View PDFchevron_right

On equivalent stability properties in semi-infinite optimization

Miguel Antonio Jiménez Pozo

ZOR Mathematical Methods of Operations Research, 1995

View PDFchevron_right

Farkas-type results and duality for DC programs with convex constraints

nghia dinh

View PDFchevron_right

Partially finite convex programming, Part I: Quasi relative interiors and duality theory

Jonathan Borwein

Mathematical Programming, 1992

View PDFchevron_right

Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs

Nguyen Tung

Mathematical Programming, 2013

View PDFchevron_right

Farkas’ Lemma and Linear Optimization in Abstract Spaces: the infinite case

David Bartl

View PDFchevron_right

Locally Farkas-Minkowski linear inequality systems

Rubén Puente

Top, 1999

View PDFchevron_right

On Duality in Semi-Infinite Programming and Existence Theorems for Linear Inequalities

Miguel Goberna

Journal of Mathematical Analysis and Applications, 1999

View PDFchevron_right

Qualification and optimality conditions for DC programs with infinite constraints

Nghia Dinh

2009

View PDFchevron_right

On the Stability of the Feasible Set in Optimization Problems

nguyen ngoc dinh

Siam Journal on Optimization, 2010

View PDFchevron_right

Semi-infinite optimization: Structure and stability of the feasible set

Gerhard-Wilhelm Weber

Journal of Optimization Theory and Applications, 1992

View PDFchevron_right

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

nghia dinh

Optimization, 2010

View PDFchevron_right

Optimality conditions for semi-infinite programming problems involving generalized convexity

Nader Kanzi

Optimization Letters, 2018

View PDFchevron_right

Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions

Huyền Khánh

Journal of Optimization Theory and Applications, 1995

View PDFchevron_right

Optimality conditions in convex optimization revisited

joydeep dutta

Optimization Letters, 2013

View PDFchevron_right

Optimality conditions for convex semi-infinite programming problems

AHARON ben-Tal

Naval Research Logistics Quarterly, 1980

View PDFchevron_right

Duality and stability in extremum problems involving convex functions

R. Rockafellar

Pacific Journal of Mathematics, 1967

View PDFchevron_right

Extending the Farkas Lemma Approach to Necessity Conditions to Infinite Programming

Richard Eduardo Coronel Tapia

1993

View PDFchevron_right

On A characterization of optimality in convex programming

Aharon Ben-tal

Mathematical Programming, 1976

View PDFchevron_right

An Optimal Alternative Theorem and Applications to Mathematical Programming

cristian vera

Journal of Global Optimization, 2007

View PDFchevron_right

Strong duality for generalized monotropic programming in infinite dimensions

Saba Majeed, Regina Burachik

View PDFchevron_right

Duality for convex infinite optimization on linear spaces

Miguel Goberna

Optimization Letters, 2022

View PDFchevron_right

Farkas’ Lemma, Gale’s Theorem, and Linear Programming: the Infinite Case in an Algebraic Way

David Bartl

2012

View PDFchevron_right

Clark's theorem for semi-infinite convex programs

Dennis Karney

Advances in Applied Mathematics, 1981

View PDFchevron_right

Variant of nontandard convex programming

Semen Kutateladze

Sib Math J Engl Tr, 1986

View PDFchevron_right

Dual Characterizations of Set Containments with Strict Convex Inequalities

THUY nguyen dinh

Journal of Global Optimization, 2006

View PDFchevron_right