Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares

DOI10.1287/moor.20.4.818zbMath0846.90098OpenAlexW2030255992WikidataQ124846218 ScholiaQ124846218MaRDI QIDQ4881512

No author found.

Publication date: 15 July 1996

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.20.4.818

zbMATH Keywords

constrained global optimizationFarkas' lemmadifference of sublinear functions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Programming in abstract spaces (90C48) Existence theories for problems in abstract spaces (49J27)

Related Items (12)

A fifth bibliography of fractional programming^* ⋮ Optimization of the difference of ICR functions ⋮ Necessary and sufficient conditions for solving infinite-dimensional linear inequalities ⋮ Global minimization of the difference of increasing co-radiant and quasi-concave functions ⋮ Asymptotic dual conditions characterizing optimality for infinite convex programs ⋮ Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization ⋮ Characterizing global optimality for DC optimization problems under convex inequality constraints ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Complete characterizations of stable Farkas' lemma and cone-convex programming duality ⋮ Farkas' lemma for separable sublinear inequalities without qualifications ⋮ The stable Farkas lemma for composite convex functions in infinite dimensional spaces ⋮ Toland-singer formula cannot distinguish a global minimizer from a choice of stationary points^*

This page was built for publication: Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares