Asymptotic dual conditions characterizing optimality for infinite convex programs
type: Item
instance of: scholarly article
title: Asymptotic dual conditions characterizing optimality for infinite convex programs
zbMATH Open document ID: 0901.90158
DOI: 10.1023/A:1022606002804
published in: Journal of Optimization Theory and Applications
publication date: 1998-03-05T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49J52
zbMATH DE Number: 1124811
zbMATH Keywords: generalized Farkas lemma
zbMATH Keywords: necessary and sufficient optimality conditions
zbMATH Keywords: infinite-dimensional convex programming
zbMATH Keywords: subdifferentials
author: V. Jeyakumar
MaRDI profile type: Publication
cites work: Q3902815
cites work: Complete characterization of optimality for convex programming in banach spaces†
cites work: Characterizations of optimality without constraint qualification for the abstract convex program
cites work: Generalizations of Slater's constraint qualification for infinite convex programs
cites work: A generalized Farkas lemma with applications to quasidifferentiable programming
cites work: A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
cites work: A Farkas lemma for difference sublinear systems and quasidifferentiable programming
cites work: Results of farkas type
cites work: Corrigendum and addendum to “results of farkas type” this journal 9, 471–520 (1987)
cites work: On systems of convex inequalities
cites work: Q4856875
cites work: Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares
cites work: Q3869074
cites work: Q5580054
cites work: Q3770273
cites work: A limiting Lagrangian for infinitely-constrained convex optimization in \(\mathbb{R}^n\)
cites work: ε-Optimal solutions in nondifferentiable convex programming and some related questions
cites work: Semismooth and Semiconvex Functions in Constrained Optimization
cites work: Optimization and nonsmooth analysis
full work available at URL: a:1022606002804
OpenAlex ID: W152555402
description: scientific article; zbMATH DE number 1124811